Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem

DOI10.1287/OPRE.41.6.1172MaRDI QIDQ4285173zbMATH OpenOpenAlexFDO

Authors Moustapha Diaby

Publication date 13 March 1994

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.41.6.1172

zbMATH Keywords

Benders decompositionlocation of facilitiesimplicit enumeration procedurepure integer 0/1 minimax problems

Mathematics Subject Classification ID

Mixed integer programming (90C11) Boolean programming (90C09) Discrete location and assignment (90B80)

Recommendations

• An Improved Implicit Enumeration Approach for Integer Programming
• An improved enumeration for pure 0-1 programs
• A new implicit enumerative search for the solution to an integer linear program
• A two-process implicit enumeration algorithm for the simple assembly line balancing problem
• Solving 0-1 Minimax Problems

Cited in

(8)

• A new necessary and sufficient global optimality condition for canonical DC problems
• 0-1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices
• An Improved Implicit Enumeration Approach for Integer Programming
• A new approach based on the surrogating method in the project time compression problems
• A new implicit enumerative search for the solution to an integer linear program
• An implicit enumeration scheme for the batch selection problem
• A revised Taha's algorithm for polynomial 0-1 programming
• A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints

This page was built for publication: Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285173)