Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. CPAIOR 2006: Cork, Ireland
- J. Christopher Beck, Barbara M. Smith:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings. Lecture Notes in Computer Science 3990, Springer 2006, ISBN 3-540-34306-7
Invited Talk
- Robert P. Bosch Jr.:
Opt Art. 1 - Maria Fox:
Planning for Mixed Discrete Continuous Domains. 2 - John N. Hooker:
Duality in Optimization and Constraint Satisfaction. 3-15
Technical Papers
- Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellmann:
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming. 16-28 - Nicolas Beldiceanu, Irit Katriel, Xavier Lorca
:
Undirected Forest Constraints. 29-43 - Luca Benini, Davide Bertozzi, Alessio Guerri, Michela Milano:
Allocation, Scheduling and Voltage Scaling on Energy Aware MPSoCs. 44-58 - Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh:
The Range Constraint: Algorithms and Implementation. 59-73 - Marco Cadoli, Fabio Patrizi:
On the Separability of Subproblems in Benders Decompositions. 74-88 - Sami Gabteni, Mattias Grönkvist:
A Hybrid Column Generation and Constraint Programming Optimizer for the Tail Assignment Problem. 89-103 - Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu:
The Power of Semidefinite Programming Relaxations for MAX-SAT. 104-118 - Irit Katriel:
Expected-Case Analysis for Delayed Filtering. 119-125 - Claire Kenyon, Meinolf Sellmann:
Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming. 126-138 - András Kovács, József Váncza:
Progressive Solutions: A Simple but Efficient Dominance Rule for Practical RCPSP. 139-151 - Radu Marinescu, Rina Dechter:
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems. 152-166 - Rasmus V. Rasmussen, Michael A. Trick:
The Timetable Constrained Distance Minimization Problem. 167-181 - Martin Sachenbacher, Brian C. Williams:
Conflict-Directed A* Search for Soft Constraints. 182-196 - Armagan Tarim, Brahim Hnich, Steven D. Prestwich:
Event-Driven Probabilistic Constraint Programming. 197-211 - Pascal Van Hentenryck, Russell Bent, Yannis Vergados:
Online Stochastic Reservation Systems. 212-227 - Pascal Van Hentenryck, Yannis Vergados:
Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling. 228-243 - Willem Jan van Hoeve, Jean-Charles Régin:
Open Constraints in a Closed World. 244-257 - Richard J. Wallace, Nic Wilson:
Conditional Lexicographic Orders in Constraint Satisfaction Problems. 258-272 - Zhao Xing, Yixin Chen, Weixiong Zhang:
An Efficient Hybrid Strategy for Temporal Planning. 273-287 - Alessandro Zanarini, Michela Milano, Gilles Pesant:
Improved Algorithm for the Soft Global Cardinality Constraint. 288-299
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
