Efficient solutions for special zero-one programming problems

DOI10.1007/s10878-005-4104-6zbMath1133.90371OpenAlexW2014632987MaRDI QIDQ995926

Ariela Bilitzky, Arik Sadeh

Publication date: 10 September 2007

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-005-4104-6

zbMATH Keywords

combinatorial optimizationlinear relaxationzero-one programming

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (2)

A modeling and computational study of the frustration index in signed networks ⋮ A class of polynomially solvable 0-1 programming problems and an application

Cites Work

• Lehman's forbidden minor characterization of ideal 0-1 matrices
• Data dependent worst case bound improving techniques in zero-one programming
• A probabilistic heuristic for a computationally difficult set covering problem
• A dual algorithm for the economic lot-sizing problem
• A quick and effective method for capacitated lot sizing with startup and reservation costs
• Set Partitioning: A survey
• A time-based formulation and upper bounding scheme for the selective travelling salesperson problem
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• Perfect zero–one matrices
• Implementation of a university course and examination timetabling system
• Unnamed Item

This page was built for publication: Efficient solutions for special zero-one programming problems