Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire
From MaRDI portal
Publication:3534211
DOI10.1051/RO:2007004zbMATH Open1168.68547OpenAlexW2105382172MaRDI QIDQ3534211FDOQ3534211
Authors: Hadrien Cambazard, Narendra Jussien 
Publication date: 3 November 2008
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/105355
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- Generalized Benders decomposition
- Radio link frequency assignment
- Principles and Practice of Constraint Programming – CP 2004
- Algorithms for hybrid MILP/CP models for a class of optimization problems
- Random constraint satisfaction: A more accurate picture
- Determining computational complexity from characteristic ``phase transitions
- Local search with constraint propagation and conflict-based heuristics
- Integrating Benders Decomposition Within Constraint Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Principles and Practice of Constraint Programming – CP 2004
- Disjunctive learning with a soft-clustering method.
Cited In (1)
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)
