A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints
This paper presents an algorithm for solving a class of mathematical programming problems that arise in connection with optimizing recovery from air base attacks. The problems are formulated as zero-one programs with geometrical constraints associated with quasirandom arrangements of circular craters imposed on taxiways. It is shown that efficient, computer-based enumerative methods may be employed successfully in the absence of algebraic representations for the constraints. The computational efficiency of the algorithm is characterized empirically using samples of randomly generated test problems. Rapid increase in solution time with growth in problem size is noted. A simple but effective means of decomposition to additive subproblems is described to help avoid long solution time. Finally, directions of current related research are given.
- Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- An Improved Implicit Enumeration Approach for Integer Programming
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm
- A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation
This page was built for publication: A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085782)
