CPAIOR 2006 - PDF Preprint Papers

CPAIOR 2006 Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CPAIOR-2006 Paper

click to vote

CPAIOR
2006
Springer

172views Operations Research» more CPAIOR 2006»

AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems

14 years 4 months ago

Download www.ics.uci.edu

Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...

Radu Marinescu 0002, Rina Dechter

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	172	AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems	claim
2	163	The Timetable Constrained Distance Minimization Problem	claim
3	149	Improved Algorithm for the Soft Global Cardinality Constraint	claim
4	146	Duality in Optimization and Constraint Satisfaction	claim
5	145	Allocation, Scheduling and Voltage Scaling on Energy Aware MPSoCs	claim
6	131	Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling	claim
7	125	An Efficient Hybrid Strategy for Temporal Planning	claim
8	120	Conflict-Directed A* Search for Soft Constraints	claim
9	117	A Hybrid Column Generation and Constraint Programming Optimizer for the Tail Assignment Problem	claim
10	103	Conditional Lexicographic Orders in Constraint Satisfaction Problems	claim
11	101	A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming	claim
12	101	Opt Art	claim
13	101	Event-Driven Probabilistic Constraint Programming	claim
14	98	Open Constraints in a Closed World	claim
15	96	Online Stochastic Reservation Systems	claim
16	86	The Range Constraint: Algorithms and Implementation	claim
17	86	The Power of Semidefinite Programming Relaxations for MAX-SAT	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers