default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8. CPAIOR 2011: Berlin, Germany
- Tobias Achterberg, J. Christopher Beck:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 8th International Conference, CPAIOR 2011, Berlin, Germany, May 23-27, 2011. Proceedings. Lecture Notes in Computer Science 6697, Springer 2011, ISBN 978-3-642-21310-6 - Craig Boutilier:
Preference Elicitation and Preference Learning in Social Choice. 1 - Ian P. Gent:
Propagation in Constraints: How One Thing Leads to Another. 2 - Andrea Lodi:
On Bilevel Programming and Its Impact in Branching, Cutting and Complexity. 3 - Markus Aschinger, Conrad Drescher, Gerhard Friedrich, Georg Gottlob
, Peter Jeavons, Anna Ryabokon, Evgenij Thorstensen:
Optimization Methods for the Partner Units Problem. 4-19 - David Bergman, Willem Jan van Hoeve, John N. Hooker:
Manipulating MDD Relaxations for Combinatorial Optimization. 20-35 - Christian Bessiere, Nina Narodytska, Claude-Guy Quimper, Toby Walsh:
The AllDifferent Constraint with Precedences. 36-52 - Nicolas Chapados, Marc Joliveau, Louis-Martin Rousseau:
Retail Store Workforce Scheduling by Expected Operating Income Maximization. 53-58 - Carleton Coffrin, Pascal Van Hentenryck, Russell Bent:
Spatial and Objective Decompositions for Very Large SCAPs. 59-75 - Bistra Dilkina, Katherine J. Lai, Carla P. Gomes:
Upgrading Shortest Paths in Networks. 76-91 - Emrah B. Edis, Ceyda Oguz:
Parallel Machine Scheduling with Additional Resources: A Lagrangian-Based Constraint Programming Approach. 92-98 - Tim Januschowski, Marc E. Pfetsch:
Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry. 99-116 - Asma Lahimer, Pierre Lopez, Mohamed Haouari:
Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks. 117-130 - Andrea Lodi, Gilles Pesant, Louis-Martin Rousseau:
On Counting Lattice Points and Chvátal-Gomory Cutting Planes. 131-136 - Michele Lombardi, Alessio Bonfietti, Michela Milano, Luca Benini:
Precedence Constraint Posting for Cyclic Scheduling Problems. 137-153 - Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff T. Linderoth, François Margot, Andreas Wächter:
A Probing Algorithm for MINLP with Failure Prediction by SVM. 154-169 - Gilles Pesant, Alessandro Zanarini:
Recovering Indirect Solution Densities for Counting-Based Branching Heuristics. 170-175 - Jean-Charles Régin:
Using Hard Constraints for Representing Soft Constraints. 176-189 - Jean-Charles Régin, Thierry Petit:
The Objective Sum Constraint. 190-195 - Helmut Simonis, Barry O'Sullivan:
Almost Square Packing. 196-209 - Thanikesavan Sivanthi, Jan Poland:
Efficient Planning of Substation Automation System Cables. 210-214 - K. Subramani, James Worthington:
A New Algorithm for Linear and Integer Feasibility in Horn Constraints. 215-229 - Petr Vilím:
Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources. 230-245 - Alessandro Zanarini, Pascal Van Hentenryck:
Identifying Patterns in Sequences of Variables. 246-251
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 2025-11-26 07:51 CET 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:
