Efficient solutions for special zero-one programming problems
From MaRDI portal
Recommendations
- Solving Large-Scale Zero-One Linear Programming Problems
- Zero-one integer programs with few contraints - lower bounding theory
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms
- Untersuchungen zu speziellen linearen gemischt-ganzzahligen 0-1-optimierungsaufgaben
- A continuous solution to linear 0-1 programming
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A dual algorithm for the economic lot-sizing problem
- A probabilistic heuristic for a computationally difficult set covering problem
- A quick and effective method for capacitated lot sizing with startup and reservation costs
- A time-based formulation and upper bounding scheme for the selective travelling salesperson problem
- Data dependent worst case bound improving techniques in zero-one programming
- Implementation of a university course and examination timetabling system
- Lehman's forbidden minor characterization of ideal 0-1 matrices
- Perfect zero–one matrices
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Set Partitioning: A survey
Cited in
(5)- A class of polynomially solvable 0-1 programming problems and an application
- A modeling and computational study of the frustration index in signed networks
- Über eine spezielle lineare o-l-optimlermagsaufgabe
- scientific article; zbMATH DE number 4027168 (Why is no real title available?)
- scientific article; zbMATH DE number 1801377 (Why is no real title available?)
This page was built for publication: Efficient solutions for special zero-one programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995926)
