default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7. CPAIOR 2010: Bologna, Italy
- Andrea Lodi, Michela Milano, Paolo Toth:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010. Proceedings. Lecture Notes in Computer Science 6140, Springer 2010 - Matteo Fischetti:
Towards a MIP-Cut Metascheme. 1-2 - Carla P. Gomes:
Challenges for CPAIOR in Computational Sustainability. 3-4 - Peter J. Stuckey:
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving. 5-9 - Nicolas Beldiceanu, Mats Carlsson, Pierre Flener
, Justin Pearson:
On Matrices, Automata, and Double Counting. 10-24 - Nicolas Beldiceanu, Fabien Hermenier, Xavier Lorca, Thierry Petit:
The Increasing Nvalue Constraint. 25-39 - Pascal Benchimol, Jean-Charles Régin, Louis-Martin Rousseau, Michel Rueher, Willem Jan van Hoeve:
Improving the Held and Karp Approach with Constraint Programming. 40-44 - Thierry Benoist:
Characterization and Automation of Matching-Based Neighborhoods. 45-50 - Timo Berthold, Thibaut Feydy, Peter J. Stuckey:
Rapid Learning for Binary Programs. 51-55 - Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan:
Hybrid Methods for the Multileaf Collimator Sequencing Problem. 56-70 - Geoffrey Chu, Maria Garcia de la Banda, Peter J. Stuckey:
Automatically Exploiting Subproblem Equivalence in Constraint Programming. 71-86 - Elvin Coban, John N. Hooker:
Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition. 87-91 - Andrew J. Davenport:
Integrated Maintenance Scheduling for Semiconductor Manufacturing. 92-96 - Kanika Dhyani, Stefano Gualandi, Paolo Cremonesi:
A Constraint Programming Approach for the Service Consolidation Problem. 97-101 - Bistra Dilkina, Carla P. Gomes:
Solving Connected Subgraph Problems in Wildlife Conservation. 102-116 - Julien Dupuis, Pierre Schaus, Yves Deville:
Consistency Check for the Bin Packing Constraint Revisited. 117-122 - Matteo Fischetti, Domenico Salvagnin:
A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts. 123-135 - Matteo Fischetti, Domenico Salvagnin:
An In-Out Approach to Disjunctive Optimization. 136-140 - Stéphane Grandcolas, Cédric Pinto:
A SAT Encoding for Multi-dimensional Packing Problems. 141-146 - Diarmuid Grimes, Emmanuel Hebrard:
Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach. 147-161 - Stefano Gualandi, Federico Malucelli, Domenico L. Sozzi:
On the Design of the Next Generation Access Networks. 162-175 - Canan Gunes, Willem Jan van Hoeve, Sridhar R. Tayur:
Vehicle Routing for Food Rescue Programs: A Comparison of Different Approaches. 176-180 - Emmanuel Hebrard, Eoin O'Mahony, Barry O'Sullivan:
Constraint Programming and Combinatorial Optimisation in Numberjack. 181-185 - Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown:
Automated Configuration of Mixed Integer Programming Solvers. 186-202 - Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann:
Upper Bounds on the Number of Solutions of Binary Integer Programs. 203-218 - Shiva Prasad Kasiviswanathan, Feng Pan:
Matrix Interdiction Problem. 219-231 - Madjid Khichane, Patrick Albert, Christine Solnon:
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization. 232-245 - Zeynep Kiziltan, Jacopo Mauro:
Service-Oriented Volunteer Computing for Massively Parallel Constraint Solving Using Portfolios. 246-251 - Anna Moss:
Constraint Programming with Arbitrarily Large Integer Variables. 252-266 - Pham Quang Dung, Yves Deville, Pascal Van Hentenryck:
Constraint-Based Local Search for Constrained Optimum Paths Problems. 267-281 - Steven D. Prestwich, S. Armagan Tarim, Roberto Rossi, Brahim Hnich:
Stochastic Constraint Programming by Neuroevolution with Filtering. 282-286 - Jean-Charles Régin, Louis-Martin Rousseau, Michel Rueher, Willem Jan van Hoeve:
The Weighted Spanning Tree Constraint Revisited. 287-291 - Aya Saad, Carmen Gervet, Slim Abdennadher:
Constraint Reasoning with Uncertain Data Using CDF-Intervals. 292-306 - Pierre Schaus, Pascal Van Hentenryck, Alessandro Zanarini:
Revisiting the Soft Global Cardinality Constraint. 307-312 - Timo Berthold, Stefan Heinz, Marco E. Lübbecke, Rolf H. Möhring, Jens Schulz:
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. 313-317 - Pascal Van Hentenryck, Russell Bent, Carleton Coffrin:
Strategic Planning for Disaster Recovery with Stochastic Last Mile Distribution. 318-333 - Feng Xie, Andrew J. Davenport:
Massively Parallel Constraint Programming for Supercomputers: Challenges and Initial Results. 334-338 - Justin Yip, Pascal Van Hentenryck, Carmen Gervet:
Boosting Set Constraint Propagation for Network Design. 339-353 - Alessandro Zanarini, Gilles Pesant:
More Robust Counting-Based Search Heuristics with Alldifferent Constraints. 354-368
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 2026-08-26 23:20 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
