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

DOI10.1287/opre.41.6.1172zbMath0791.90035OpenAlexW1972773329MaRDI QIDQ4285173

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) Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (3)

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 ⋮ A new approach based on the surrogating method in the project time compression problems

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