CPAIOR B

33 papers

YearTitle / Authors
2013A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem.
Duc-Cuong Dang, Racha El-Hajj, Aziz Moukrim
2013A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects.
Hanyu Gu, Andreas Schutt, Peter J. Stuckey
2013A Lagrangian Relaxation for Golomb Rulers.
Marla R. Slusky, Willem Jan van Hoeve
2013A Synchronized Sweep Algorithm for the
Arnaud Letort, Mats Carlsson, Nicolas Beldiceanu
2013An Adaptive Model Restarts Heuristic.
Nina Narodytska, Toby Walsh
2013An Empirical Evaluation of Portfolios Approaches for Solving CSPs.
Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro
2013An MDD Approach to Multidimensional Bin Packing.
Brian Kell, Willem Jan van Hoeve
2013CP Methods for Scheduling and Routing with Time-Dependent Task Costs.
Elena Kelareva, Kevin Tierney, Philip Kilby
2013Cloud Branching.
Timo Berthold, Domenico Salvagnin
2013Coalition Formation for Servicing Dynamic Motion Tasks.
Udara Weerakoon, Vicki Allan
2013Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization.
Jiadong Wang, Ted K. Ralphs
2013Constraint-Based Fitness Function for Search-Based Software Testing.
Abdelilah Sakti, Yann-Gaël Guéhéneuc, Gilles Pesant
2013Decision Diagrams and Dynamic Programming.
John N. Hooker
2013Enumerating Infeasibility: Finding Multiple MUSes Quickly.
Mark H. Liffiton, Ammar Malik
2013Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint.
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey
2013Improved Discrete Reformulations for the Quadratic Assignment Problem.
Axel Nyberg, Tapio Westerlund, Andreas Lundell
2013Improving Strong Branching by Propagation.
Gerald Gamrath
2013Integration 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
Carla P. Gomes, Meinolf Sellmann
2013Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming.
Ambros M. Gleixner, Stefan Weltge
2013MiniZinc with Functions.
Peter J. Stuckey, Guido Tack
2013Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling.
André A. Ciré, Elvin Coban, John N. Hooker
2013Modeling Robustness in CSPs as Weighted CSPs.
Laura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber
2013On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables.
Hermann Schichl, Arnold Neumaier, Mihály Csaba Markót, Ferenc Domes
2013Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods.
Domenico Salvagnin
2013Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling.
Stefan Heinz, Wen-Yang Ku, J. Christopher Beck
2013Revisiting Hyper Binary Resolution.
Marijn Heule, Matti Järvisalo, Armin Biere
2013Solving (Weighted) Partial MaxSAT with ILP.
Carlos Ansótegui, Joel Gabàs
2013Solving Wind Farm Layout Optimization with Mixed Integer Programming and Constraint Programming.
Peter Y. Zhang, David A. Romero, J. Christopher Beck, Cristina H. Amon
2013Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms.
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini
2013Stronger Inference through Implied Literals from Conflicts and Knapsack Covers.
Tobias Achterberg, Ashish Sabharwal, Horst Samulowitz
2013The Rooted Maximum Node-Weight Connected Subgraph Problem.
Eduardo Álvarez-Miranda, Ivana Ljubic, Petra Mutzel
2013Tight LP-Relaxations of Overlapping Global Cardinality Constraints.
Ioannis Mourtos
2013Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem.
Yuri Malitsky, Deepak Mehta, Barry O'Sullivan, Helmut Simonis