-
作者：Codato, Gianni; Fischetti, Matteo
作者单位：University of Padua
摘要：Mixed-integer programs (MIPs) involving logical implications modeled through big-M coefficients are notoriously among the hardest to solve. In this paper, we propose and analyze computationally an automatic problem reformulation of quite general applicability, aimed at removing the model dependency on the big-M coefficients. Our solution scheme defines a master integer linear problem (ILP) with no continuous variables, which contains combinatorial information on the feasible integer variable c...
-
作者：Frangioni, Antonio; Gentile, Claudio
作者单位：University of Pisa; Consiglio Nazionale delle Ricerche (CNR); Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti (IASI-CNR)
摘要：We present a dynamic programming algorithm for solving the single-unit commitment (IUC) problem with ramping constraints and arbitrary convex cost functions. The algorithm is based on a new approach for efficiently solving the single-unit economic dispatch (ED) problem with ramping constraints and arbitrary convex cost functions, improving on previously known ones that were limited to piecewise-linear functions. For simple convex functions, such as the quadratic ones typically used in applicat...
-
作者：Yong Tan; Chiang, I. Robert; Mookerjee, Vijay S.
作者单位：University of Washington; University of Washington Seattle; Accenture; University of Texas System; University of Texas Dallas
摘要：Transit and peering arrangements among Internet backbone providers (IBPs) are essential for the global delivery of communication services on the Internet. In addition, to support delay-sensitive applications (e.g., streaming and multimedia applications) it is important for IBPs to maintain high service quality even if the network is congested. One promising approach is to establish interconnection agreements among providers to dynamically trade network capacity. To make such interconnections p...
-
作者：Kubzin, M. A.; Strusevich, V. A.
作者单位：University of Greenwich
摘要：We consider the two-machine open shop and two-machine flow shop scheduling problems in which each machine has to be maintained exactly once during the planning period, and the duration of each of these intervals depends on its start time. The objective is to minimize the maximum completion time of all activities to be scheduled. We resolve complexity and approximability issues of these problems. The open shop problem is shown to be polynomially solvable for quite general functions defining the...
-
作者：Feng, Qi; Sethi, Suresh P.; Yan, Houmin; Zhang, Hanqin
作者单位：University of Texas System; University of Texas Dallas; University of Texas System; University of Texas Dallas; Chinese University of Hong Kong; Chinese Academy of Sciences; Academy of Mathematics & System Sciences, CAS
摘要：We present a periodic review inventory model with multiple delivery modes. While base-stock policies are optimal for one or two consecutive delivery modes, they are not so otherwise. For multiple consecutive delivery modes, we show that only the fastest two modes have optimal base stocks, and provide a simple counterexample to show that the remaining ones do not. We investigate why the base-stock policy is or is not optimal in different situations. This note is an abridged version of Feng et a...
