Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire
From MaRDI portal
Publication:3534211
Recommendations
Cites work
- scientific article; zbMATH DE number 2080311 (Why is no real title available?)
- scientific article; zbMATH DE number 2084732 (Why is no real title available?)
- Algorithms for hybrid MILP/CP models for a class of optimization problems
- Determining computational complexity from characteristic ``phase transitions
- Disjunctive learning with a soft-clustering method.
- Generalized Benders decomposition
- Integrating Benders Decomposition Within Constraint Programming
- Local search with constraint propagation and conflict-based heuristics
- Logic-based Benders decomposition
- Partitioning procedures for solving mixed-variables programming problems
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Radio link frequency assignment
- Random constraint satisfaction: A more accurate picture
This page was built for publication: Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3534211)