


default search action
4. CPAIOR 2007: Brussels, Belgium
- Pascal Van Hentenryck, Laurence A. Wolsey:

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings. Lecture Notes in Computer Science 4510, Springer 2007, ISBN 978-3-540-72396-7 - Davaatseren Baatar, Natashia Boland, Sebastian Brand, Peter J. Stuckey:

Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches. 1-15 - Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabharwal, Jordan Suter:

Connections in Networks: Hardness of Feasibility Versus Optimality. 16-28 - Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau:

Modeling the Regular Constraint with Integer Programming. 29-43 - Luca Di Gaspero, Giacomo di Tollo, Andrea Roli, Andrea Schaerf:

Hybrid Local Search for Constrained Financial Portfolio Selection Problems. 44-58 - Grégoire Dooms, Irit Katriel:

The "Not-Too-Heavy Spanning Tree" Constraint. 59-70 - Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Sais:

Eliminating Redundant Clauses in SAT Instances. 71-83 - Tarik Hadzic, John N. Hooker:

Cost-Bounded Binary Decision Diagrams for 0-1 Programming. 84-98 - Wafa Karoui, Marie-José Huguet, Pierre Lopez, Wady Naanaa:

YIELDS: A Yet Improved Limited Discrepancy Search for CSPs. 99-111 - András Kovács, J. Christopher Beck:

A Global Constraint for Total Weighted Completion Time. 112-126 - András Kéri, Tamás Kis

:
Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method. 127-140 - Nicolas Beldiceanu, Xavier Lorca

:
Necessary Condition for Path Partitioning Constraints. 141-154 - David F. Manlove, Gregg O'Malley, Patrick Prosser, Chris Unsworth:

A Constraint Programming Approach to the Hospitals / Residents Problem. 155-170 - Radu Marinescu, Rina Dechter:

Best-First AND/OR Search for 0/1 Integer Programming. 171-185 - Jean-Noël Monette, Yves Deville, Pierre Dupont:

A Position-Based Propagator for the Open-Shop Problem. 186-199 - Wady Naanaa:

Directional Interchangeability for Enhancing CSP Solving. 200-213 - Nicolas Beldiceanu, Emmanuel Poder:

A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production. 214-228 - Roberto Rossi, Armagan Tarim, Brahim Hnich

, Steven D. Prestwich:
Replenishment Planning for Stochastic Inventory Systems with Shortage Cost. 229-243 - Sivan Sabato

, Yehuda Naveh:
Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search. 244-259 - Pierre Schaus, Yves Deville, Pierre Dupont, Jean-Charles Régin:

The Deviation Constraint. 260-274 - Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal:

The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width. 275-287 - Jan-Georg Smaus:

On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint. 288-302 - Daria Terekhov, J. Christopher Beck:

Solving a Stochastic Queueing Control Problem with Constraint Programming. 303-317 - Yu Xia:

Constrained Clustering Via Concavity Cuts. 318-331 - Michael A. Trick

, Hakan Yildiz:
Bender's Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem. 332-345 - Michael A. Trick

, Hakan Yildiz:
A Large Neighborhood Search Heuristic for Graph Coloring. 346-360 - Alessandro Zanarini, Gilles Pesant:

Generalizations of the Global Cardinality Constraint for Hierarchical Resources. 361-375 - J. M. van den Akker

, Guido Diepen, J. A. Hoogeveen:
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems. 376-390

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














