A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints

DOI10.1016/0305-0548(84)90020-0MaRDI QIDQ1085782zbMATH OpenOpenAlexFDO

Authors R. Michael Harnett

Publication date 1984

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(84)90020-0

zbMATH Keywords

decomposition to additive subproblemsgeometrical constraintsmilitary management

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Operations research and management science (90B99) Boolean programming (90C09) Applications of mathematical programming (90C90)

Recommendations

• 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

Cites work

• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables

Cited in

(1)

• A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints

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)