Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642298271, 9783642298288

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Contractor Based on Convex Interval Taylor

Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29828-8_1 ◽

2012 ◽

pp. 1-16 ◽

Cited By ~ 21

Author(s):

Ignacio Araya ◽

Gilles Trombettoni ◽

Bertrand Neveu

Download Full-text

Hybrid Heuristics for Multimodal Homecare Scheduling

Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29828-8_22 ◽

2012 ◽

pp. 339-355 ◽

Cited By ~ 9

Author(s):

Andrea Rendl ◽

Matthias Prandtstetter ◽

Gerhard Hiermann ◽

Jakob Puchinger ◽

Günther Raidl

Keyword(s):

Hybrid Heuristics

Download Full-text

Explaining Flow-Based Propagation

Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29828-8_10 ◽

2012 ◽

pp. 146-162 ◽

Cited By ~ 5

Author(s):

Nicholas Downing ◽

Thibaut Feydy ◽

Peter J. Stuckey

Download Full-text

Solving the Longest Simple Path Problem with Constraint-Based Techniques

Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29828-8_19 ◽

2012 ◽

pp. 292-306 ◽

Cited By ~ 2

Author(s):

Quang Dung Pham ◽

Yves Deville

Keyword(s):

Simple Path

Download Full-text

fdcc: A Combined Approach for Solving Constraints over Finite Domains and Arrays

Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29828-8_2 ◽

2012 ◽

pp. 17-33 ◽

Cited By ~ 2

Author(s):

Sébastien Bardin ◽

Arnaud Gotlieb

Keyword(s):

Combined Approach ◽

Finite Domains

Download Full-text

Maximising the Net Present Value for Resource-Constrained Project Scheduling

Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29828-8_24 ◽

2012 ◽

pp. 362-378 ◽

Cited By ~ 14

Author(s):

Andreas Schutt ◽

Geoffrey Chu ◽

Peter J. Stuckey ◽

Mark G. Wallace

Keyword(s):

Project Scheduling ◽

Net Present Value ◽

Present Value ◽

Resource Constrained ◽

Resource Constrained Project Scheduling

Download Full-text

Reconsidering Mixed Integer Programming and MIP-Based Hybrids for Scheduling

Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29828-8_14 ◽

2012 ◽

pp. 211-227 ◽

Cited By ~ 6

Author(s):

Stefan Heinz ◽

J. Christopher Beck

Keyword(s):

Integer Programming ◽

Mixed Integer Programming ◽

Mixed Integer

Download Full-text

Randomized Adaptive Vehicle Decomposition for Large-Scale Power Restoration

Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29828-8_25 ◽

2012 ◽

pp. 379-394 ◽

Cited By ~ 9

Author(s):

Ben Simon ◽

Carleton Coffrin ◽

Pascal Van Hentenryck

Keyword(s):

Large Scale ◽

Power Restoration

Download Full-text

Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation

Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29828-8_16 ◽

2012 ◽

pp. 244-259 ◽

Cited By ~ 12

Author(s):

Yuri Malitsky ◽

Meinolf Sellmann

Keyword(s):

Model Based ◽

Algorithm Configuration

Download Full-text

Flow-Based Combinatorial Chance Constraints

Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29828-8_9 ◽

2012 ◽

pp. 129-145

Author(s):

Andre A. Cire ◽

Elvin Coban ◽

Willem-Jan van Hoeve

Keyword(s):

Chance Constraints

Download Full-text

Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A Contractor Based on Convex Interval Taylor

Hybrid Heuristics for Multimodal Homecare Scheduling

Explaining Flow-Based Propagation

Solving the Longest Simple Path Problem with Constraint-Based Techniques

fdcc: A Combined Approach for Solving Constraints over Finite Domains and Arrays

Maximising the Net Present Value for Resource-Constrained Project Scheduling

Reconsidering Mixed Integer Programming and MIP-Based Hybrids for Scheduling

Randomized Adaptive Vehicle Decomposition for Large-Scale Power Restoration

Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation

Flow-Based Combinatorial Chance Constraints

Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - Lecture Notes in Computer Science
Latest Publications