489 search results - page 35 / 98 » Formulations and Reformulations in Integer Programming |
MP
2006
13 years 7 months ago
2006
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be ...
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results ...
COCOON
2003
Springer
14 years 1 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
VLSID
1994
IEEE
13 years 12 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
EOR
2010
13 years 7 months ago
2010
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...