Sciweavers

113 search results - page 11 / 23
» Combinatorial Flag Varieties
Sort
View
CP
2004
Springer
14 years 22 days ago
Constraint-Based Combinators for Local Search
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
Pascal Van Hentenryck, Laurent Michel, Liyuan Liu
COCOON
2006
Springer
13 years 11 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
13 years 7 months ago
Evaluating the impact of AND/OR search on 0-1 integer linear programming
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
Radu Marinescu 0002, Rina Dechter
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
13 years 5 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
JCT
2011
67views more  JCT 2011»
13 years 2 months ago
Inversion arrangements and Bruhat intervals
Let W be a finite reflection group. For a given w ∈ W, the following assertion may or may not be satisfied: (∗) The principal Bruhat order ideal of w contains as many elemen...
Axel Hultman