Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14. CPAIOR 2017: Padua, Italy
- Domenico Salvagnin, Michele Lombardi:
Integration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017, Proceedings. Lecture Notes in Computer Science 10335, Springer 2017, ISBN 978-3-319-59775-1
Technical Papers
- Zakaria Chihani, Bruno Marre, François Bobot
, Sébastien Bardin:
Sharpening Constraint Programming Approaches for Bit-Vector Theory. 3-20 - Nicolas Beldiceanu, Mats Carlsson, Alban Derrien, Charles Prud'homme, Andreas Schutt, Peter J. Stuckey:
Range-Consistent Forbidden Regions of Allen's Relations. 21-29 - Guillaume Perez, Jean-Charles Régin:
MDDs are Efficient Modeling Tools: An Application to Some Statistical Constraints. 30-40 - David Bergman, André Augusto Ciré:
On Finding the Optimal BDD Relaxation. 41-50 - Joseph D. Scott, Pierre Flener, Justin Pearson, Christian Schulte:
Design and Implementation of Bounded-Length Sequence Variables. 51-67 - Mateo Díaz, Ronan Le Bras, Carla P. Gomes:
In Search of Balance: The Challenge of Generating Balanced Latin Rectangles. 68-76 - Kevin Leo, Guido Tack:
Debugging Unsatisfiable Constraint Models. 77-93 - Sicco Verwer, Yingqian Zhang:
Learning Decision Trees with Flexible Constraints and Objectives Using Integer Optimization. 94-103 - Junwen Bai, Johan Bjorck, Yexiang Xue, Santosh K. Suram, John M. Gregoire, Carla P. Gomes:
Relaxation Methods for Constrained Matrix Factorization Problems: Solving the Phase Mapping Problem in Materials Discovery. 104-112 - Diego de Uña, Graeme Gange, Peter Schachte, Peter J. Stuckey:
Minimizing Landscape Resistance for Habitat Conservation. 113-130 - Alessandro Zanarini, Jan Poland:
A Hybrid Approach for Stator Winding Design Optimization. 131-146 - Mohamed Wahbi, Diarmuid Grimes, Deepak Mehta, Kenneth N. Brown, Barry O'Sullivan:
A Distributed Optimization Method for the Geographically Distributed Data Centres Problem. 147-166 - Emmanuel Hebrard, Mohamed Siala:
Explanation-Based Weighted Degree. 167-175 - Antoine Delaite, Gilles Pesant:
Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems. 176-184 - Vinasétan Ratheil Houndji, Pierre Schaus, Mahouton Norbert Hounkonnou, Laurence A. Wolsey:
The Weighted Arborescence Constraint. 185-201 - Markus Kruber, Marco E. Lübbecke, Axel Parmentier:
Learning When to Use a Decomposition. 202-210 - Jakob Witzig, Timo Berthold, Stefan Heinz:
Experiments with Conflict Analysis in Mixed Integer Programming. 211-220 - Omid Sanei Bajgiran, André A. Ciré, Louis-Martin Rousseau:
A First Look at Picking Dual Variables for Maximizing Reduced Cost Fixing. 221-228 - Emily Speakman, Han Yu, Jon Lee:
Experimental Validation of Volume-Based Comparison for Double-McCormick Relaxations. 229-243 - Miao Yu, Viswanath Nagarajan, Siqian Shen:
Minimum Makespan Vehicle Routing Problem with Compatibility Constraints. 244-253 - Natashia Boland, Mike Hewitt, Duc Minh Vu, Martin W. P. Savelsbergh:
Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks. 254-262 - Murodzhon Akhmedov, Alexander LeNail, Francesco Bertoni, Ivo Kwee, Ernest Fraenkel, Roberto Montemanni:
A Fast Prize-Collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks. 263-276 - David Hemmi, Guido Tack, Mark Wallace:
Scenario-Based Learning for Stochastic Combinatorial Optimisation. 277-292 - Alessandro Zanarini:
Optimal Stock Sizing in a Cutting Stock Problem with Stochastic Demands. 293-301 - Kiriakos-Simon Mountakis, Tomas Klos, Cees Witteveen:
Stochastic Task Networks - Trading Performance for Stability. 302-311 - Quentin Cappart, Pierre Schaus:
Rescheduling Railway Traffic on Real Time Situations Using Time-Interval Variables. 312-327 - Kiriakos-Simon Mountakis, Tomas Klos, Cees Witteveen:
Dynamic Temporal Decoupling. 328-343 - Lucas Kletzander, Nysret Musliu:
A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem. 344-358 - Maël Minot, Samba Ndojh Ndiaye, Christine Solnon:
Combining CP and ILP in a Tree Decomposition of Bounded Height for the Sum Colouring Problem. 359-375 - Michael Abseher, Nysret Musliu, Stefan Woltran:
htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond. 376-386 - Hong Xu, T. K. Satish Kumar, Sven Koenig:
The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP. 387-402 - Mirco Gelain, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh:
A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling Problems. 403-418
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-06-10 21:32 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:
