The progressive party problem: Integer linear programming and constraint programming compared
- 1 September 1996
- journal article
- Published by Springer Nature in Constraints
- Vol. 1 (1) , 119-138
- https://doi.org/10.1007/bf00143880
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On the satisfiability of symmetrical constrained satisfaction problemsPublished by Springer Nature ,1993
- The Elimination of Integer VariablesJournal of the Operational Research Society, 1992
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980