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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540723967, 9783540723974

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Eliminating Redundant Clauses in SAT Instances

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

10.1007/978-3-540-72397-4_6 ◽

2007 ◽

pp. 71-83 ◽

Cited By ~ 8

Author(s):

Olivier Fourdrinoy ◽

Éric Grégoire ◽

Bertrand Mazure ◽

Lakhdar Saïs

Download Full-text

Cost-Bounded Binary Decision Diagrams for 0-1 Programming

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

10.1007/978-3-540-72397-4_7 ◽

2007 ◽

pp. 84-98 ◽

Cited By ~ 13

Author(s):

Tarik Hadžić ◽

J. N. Hooker

Keyword(s):

Binary Decision Diagrams ◽

Decision Diagrams ◽

Binary Decision

Download Full-text

A Position-Based Propagator for the Open-Shop Problem

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

10.1007/978-3-540-72397-4_14 ◽

2007 ◽

pp. 186-199

Author(s):

Jean-Noël Monette ◽

Yves Deville ◽

Pierre Dupont

Keyword(s):

Open Shop ◽

Open Shop Problem

Download Full-text

The Deviation Constraint

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

10.1007/978-3-540-72397-4_19 ◽

2007 ◽

pp. 260-274 ◽

Cited By ~ 20

Author(s):

Pierre Schaus ◽

Yves Deville ◽

Pierre Dupont ◽

Jean-Charles Régin

Download Full-text

Replenishment Planning for Stochastic Inventory Systems with Shortage Cost

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

10.1007/978-3-540-72397-4_17 ◽

2007 ◽

pp. 229-243 ◽

Cited By ~ 4

Author(s):

Roberto Rossi ◽

S. Armagan Tarim ◽

Brahim Hnich ◽

Steven Prestwich

Keyword(s):

Inventory Systems ◽

Stochastic Inventory ◽

Shortage Cost

Download Full-text

A Large Neighborhood Search Heuristic for Graph Coloring

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

10.1007/978-3-540-72397-4_25 ◽

2007 ◽

pp. 346-360 ◽

Cited By ~ 9

Author(s):

Michael A. Trick ◽

Hakan Yildiz

Keyword(s):

Graph Coloring ◽

Neighborhood Search ◽

Large Neighborhood Search ◽

Search Heuristic ◽

Large Neighborhood

Download Full-text

On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint

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

10.1007/978-3-540-72397-4_21 ◽

2007 ◽

pp. 288-302 ◽

Cited By ~ 3

Author(s):

Jan-Georg Smaus

Keyword(s):

Boolean Functions

Download Full-text

The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width

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

10.1007/978-3-540-72397-4_20 ◽

2007 ◽

pp. 275-287 ◽

Cited By ~ 3

Author(s):

Meinolf Sellmann ◽

Luc Mercier ◽

Daniel H. Leventhal

Keyword(s):

Linear Programming ◽

Binary Constraint ◽

Tree Width

Download Full-text

Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method

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

10.1007/978-3-540-72397-4_10 ◽

2007 ◽

pp. 127-140 ◽

Cited By ~ 1

Author(s):

András Kéri ◽

Tamás Kis

Keyword(s):

Time Windows ◽

Dual Method ◽

Primal Dual

Download Full-text

A Global Constraint for Total Weighted Completion Time

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

10.1007/978-3-540-72397-4_9 ◽

2007 ◽

pp. 112-126 ◽

Cited By ~ 2

Author(s):

András Kovács ◽

J. Christopher Beck

Keyword(s):

Completion Time ◽

Total Weighted Completion Time ◽

Global Constraint ◽

Weighted Completion Time

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Eliminating Redundant Clauses in SAT Instances

Cost-Bounded Binary Decision Diagrams for 0-1 Programming

A Position-Based Propagator for the Open-Shop Problem

The Deviation Constraint

Replenishment Planning for Stochastic Inventory Systems with Shortage Cost

A Large Neighborhood Search Heuristic for Graph Coloring

On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint

The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width

Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method

A Global Constraint for Total Weighted Completion Time

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