Sciweavers

1144 search results - page 25 / 229
» Logic programming for combinatorial problems
Sort
View
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 6 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
COCOA
2009
Springer
14 years 2 months ago
Matching Techniques Ride to Rescue OLED Displays
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
Andreas Karrenbauer
4OR
2010
137views more  4OR 2010»
13 years 7 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...
ICTAI
2008
IEEE
14 years 2 months ago
Haplotype Inference with Boolean Constraint Solving: An Overview
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
Inês Lynce, Ana Graça, João Ma...
HEURISTICS
2002
146views more  HEURISTICS 2002»
13 years 7 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...