Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10. CPAIOR 2013: Yorktown Heights, NY, USA
- Carla P. Gomes, Meinolf Sellmann:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 10th International Conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18-22, 2013. Proceedings. Lecture Notes in Computer Science 7874, Springer 2013, ISBN 978-3-642-38170-6 - Tobias Achterberg, Ashish Sabharwal, Horst Samulowitz:
Stronger Inference through Implied Literals from Conflicts and Knapsack Covers. 1-11 - Stefan Heinz, Wen-Yang Ku, J. Christopher Beck:
Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling. 12-27 - Timo Berthold, Domenico Salvagnin:
Cloud Branching. 28-43 - Laura Climent
, Richard J. Wallace, Miguel A. Salido, Federico Barber:
Modeling Robustness in CSPs as Weighted CSPs. 44-60 - Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini:
Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms. 61-76 - Marijn Heule, Matti Järvisalo, Armin Biere:
Revisiting Hyper Binary Resolution. 77-93 - John N. Hooker:
Decision Diagrams and Dynamic Programming. 94-110 - Elena Kelareva, Kevin Tierney, Philip Kilby:
CP Methods for Scheduling and Routing with Time-Dependent Task Costs. 111-127 - Brian Kell, Willem Jan van Hoeve:
An MDD Approach to Multidimensional Bin Packing. 128-143 - Arnaud Letort, Mats Carlsson, Nicolas Beldiceanu:
A Synchronized Sweep Algorithm for the k-dimensional cumulative Constraint. 144-159 - Mark H. Liffiton, Ammar Malik:
Enumerating Infeasibility: Finding Multiple MUSes Quickly. 160-175 - Yuri Malitsky, Deepak Mehta, Barry O'Sullivan, Helmut Simonis:
Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem. 176-192 - Axel Nyberg, Tapio Westerlund, Andreas Lundell:
Improved Discrete Reformulations for the Quadratic Assignment Problem. 193-203 - Domenico Salvagnin:
Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods. 204-215 - Hermann Schichl, Arnold Neumaier, Mihály Csaba Markót, Ferenc Domes:
On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables. 216-233 - Andreas Schutt, Thibaut Feydy, Peter J. Stuckey:
Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint. 234-250 - Marla R. Slusky, Willem Jan van Hoeve:
A Lagrangian Relaxation for Golomb Rulers. 251-267 - Peter J. Stuckey, Guido Tack:
MiniZinc with Functions. 268-283 - Peter Y. Zhang, David A. Romero, J. Christopher Beck, Cristina H. Amon:
Solving Wind Farm Layout Optimization with Mixed Integer Programming and Constraint Programming. 284-299 - Eduardo Álvarez-Miranda, Ivana Ljubic, Petra Mutzel:
The Rooted Maximum Node-Weight Connected Subgraph Problem. 300-315 - Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro:
An Empirical Evaluation of Portfolios Approaches for Solving CSPs. 316-324 - André A. Ciré, Elvin Coban, John N. Hooker:
Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling. 325-331 - Duc-Cuong Dang, Racha El-Hajj, Aziz Moukrim:
A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem. 332-339 - Hanyu Gu, Andreas Schutt, Peter J. Stuckey:
A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects. 340-346 - Gerald Gamrath:
Improving Strong Branching by Propagation. 347-354 - Ambros M. Gleixner, Stefan Weltge:
Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming. 355-361 - Ioannis Mourtos:
Tight LP-Relaxations of Overlapping Global Cardinality Constraints. 362-368 - Nina Narodytska, Toby Walsh:
An Adaptive Model Restarts Heuristic. 369-377 - Abdelilah Sakti, Yann-Gaël Guéhéneuc, Gilles Pesant:
Constraint-Based Fitness Function for Search-Based Software Testing. 378-385 - Udara Weerakoon, Vicki Allan:
Coalition Formation for Servicing Dynamic Motion Tasks. 386-393 - Jiadong Wang, Ted K. Ralphs:
Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization. 394-402
- Carlos Ansótegui, Joel Gabàs:
Solving (Weighted) Partial MaxSAT with ILP. 403-409
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-22 21:05 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:
