Sciweavers

77 search results - page 6 / 16
» New integer linear programming approaches for course timetab...
Sort
View
COLOGNETWENTE
2009
14 years 10 months ago
Improved Strategies for Branching on General Disjunctions
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
Gérard Cornuéjols, Leo Liberti, Giac...
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
14 years 11 months ago
A New Approach to Exact Crossing Minimization
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Markus Chimani, Petra Mutzel, Immanuel M. Bomze
IJCAI
1989
14 years 10 months ago
An Algebraic Approach to Constraint Satisfaction Problems
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
Igor Rivin, Ramin Zabih
DATE
2009
IEEE
122views Hardware» more  DATE 2009»
15 years 4 months ago
A MILP-based approach to path sensitization of embedded software
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
José C. Costa, José C. Monteiro
92
Voted
MICS
2008
124views more  MICS 2008»
14 years 7 months ago
Community Structures of Networks
We present an approach to studying the community structures of networks by using linear programming (LP). Starting with a network in terms of (a) a collection of nodes and (b) a co...
William Y. C. Chen, Andreas W. M. Dress, Winking Q...