4 papers · 1 filter
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing
Jamie Fravel, Robert Hildebrand
An integer program is called ideal if its continuous relaxation coincides with its convex hull allowing the problem to be solved as a continuous program and offering substantial co…
Complexity of Integer Programming in Reverse Convex Sets via Boundary Hyperplane Cover
Robert Hildebrand, Adrian GöÃ
We study the complexity of identifying the integer feasibility of reverse convex sets. We present various settings where the complexity can be either NP-Hard or efficiently solvabl…
Job Shop Scheduling with Integer Programming, Shifting Bottleneck, and Decision Diagrams: A Computational Study
Brannon King, Robert Hildebrand
We study heuristic algorithms for job shop scheduling problems. We compare classical approaches, such as the shifting bottleneck heuristic with novel strategies using decision diag…
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing
Jamie Fravel, Robert Hildebrand
We develop an optimization framework for identifying ideal Mixed Binary Linear Programs (MBLP) which is linear when using known input data and nonconvex quadratic over parametric i…