Integration of AI and OR Techniques in Constraint Programming - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319597751, 9783319597768

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

In Search of Balance: The Challenge of Generating Balanced Latin Rectangles

Integration of AI and OR Techniques in Constraint Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59776-8_6 ◽

2017 ◽

pp. 68-76

Author(s):

Mateo Díaz ◽

Ronan Le Bras ◽

Carla Gomes

Download Full-text

A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling Problems

Integration of AI and OR Techniques in Constraint Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59776-8_32 ◽

2017 ◽

pp. 403-418

Author(s):

Mirco Gelain ◽

Maria Silvia Pini ◽

Francesca Rossi ◽

Kristen Brent Venable ◽

Toby Walsh

Keyword(s):

Local Search ◽

Experimental Results ◽

Soft Constraint ◽

Scheduling Problems ◽

Meeting Scheduling ◽

Search Approach

Download Full-text

Scenario-Based Learning for Stochastic Combinatorial Optimisation

Integration of AI and OR Techniques in Constraint Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59776-8_23 ◽

2017 ◽

pp. 277-292

Author(s):

David Hemmi ◽

Guido Tack ◽

Mark Wallace

Keyword(s):

Combinatorial Optimisation

Download Full-text

A Distributed Optimization Method for the Geographically Distributed Data Centres Problem

Integration of AI and OR Techniques in Constraint Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59776-8_12 ◽

2017 ◽

pp. 147-166 ◽

Cited By ~ 1

Author(s):

Mohamed Wahbi ◽

Diarmuid Grimes ◽

Deepak Mehta ◽

Kenneth N. Brown ◽

Barry O’Sullivan

Keyword(s):

Distributed Optimization ◽

Optimization Method ◽

Distributed Data ◽

Geographically Distributed ◽

Data Centres

Download Full-text

Learning When to Use a Decomposition

Integration of AI and OR Techniques in Constraint Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59776-8_16 ◽

2017 ◽

pp. 202-210 ◽

Cited By ~ 10

Author(s):

Markus Kruber ◽

Marco E. Lübbecke ◽

Axel Parmentier

Download Full-text

Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems

Integration of AI and OR Techniques in Constraint Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59776-8_14 ◽

2017 ◽

pp. 176-184 ◽

Cited By ~ 2

Author(s):

Antoine Delaite ◽

Gilles Pesant

Keyword(s):

Spanning Tree ◽

Spanning Trees ◽

Minimum Spanning Tree

Download Full-text

A First Look at Picking Dual Variables for Maximizing Reduced Cost Fixing

Integration of AI and OR Techniques in Constraint Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59776-8_18 ◽

2017 ◽

pp. 221-228 ◽

Cited By ~ 3

Author(s):

Omid Sanei Bajgiran ◽

Andre A. Cire ◽

Louis-Martin Rousseau

Keyword(s):

Dual Variables

Download Full-text

Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks

Integration of AI and OR Techniques in Constraint Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59776-8_21 ◽

2017 ◽

pp. 254-262 ◽

Cited By ~ 4

Author(s):

Natashia Boland ◽

Mike Hewitt ◽

Duc Minh Vu ◽

Martin Savelsbergh

Keyword(s):

Traveling Salesman Problem ◽

Time Windows ◽

Traveling Salesman ◽

Time Expanded Networks ◽

The Traveling Salesman Problem

Download Full-text

htd – A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond

Integration of AI and OR Techniques in Constraint Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59776-8_30 ◽

2017 ◽

pp. 376-386 ◽

Cited By ~ 10

Author(s):

Michael Abseher ◽

Nysret Musliu ◽

Stefan Woltran

Keyword(s):

Open Source ◽

Open Source Framework ◽

Tree Decompositions ◽

Free Open Source

Download Full-text

Experiments with Conflict Analysis in Mixed Integer Programming

Integration of AI and OR Techniques in Constraint Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59776-8_17 ◽

2017 ◽

pp. 211-220 ◽

Cited By ~ 8

Author(s):

Jakob Witzig ◽

Timo Berthold ◽

Stefan Heinz

Keyword(s):

Integer Programming ◽

Mixed Integer Programming ◽

Conflict Analysis ◽

Mixed Integer

Download Full-text

Integration of AI and OR Techniques in Constraint Programming - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

In Search of Balance: The Challenge of Generating Balanced Latin Rectangles

A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling Problems

Scenario-Based Learning for Stochastic Combinatorial Optimisation

A Distributed Optimization Method for the Geographically Distributed Data Centres Problem

Learning When to Use a Decomposition

Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems

A First Look at Picking Dual Variables for Maximizing Reduced Cost Fixing

Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks

htd – A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond

Experiments with Conflict Analysis in Mixed Integer Programming

Integration of AI and OR Techniques in Constraint Programming - Lecture Notes in Computer Science
Latest Publications