Given a set of n elements, each of which is colored one of c 2 colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal co...
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
Marjan van den Akker, Cor A. J. Hurkens, Martin W....
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among th...
Adam N. Letchford, Richard W. Eglese, Jens Lysgaar...
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
Abstract. We consider feasible sets given by conic constraints, where the cone defining the constraints is convex with nonempty interior. We study the case where the feasible set i...