Sciweavers

1723 search results - page 93 / 345
» Cycling in linear programming problems
Sort
View
CSCLP
2004
Springer
15 years 8 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
EVOW
2007
Springer
15 years 9 months ago
A Hybrid Method for Solving Large-Scale Supply Chain Problems
Abstract. The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be op...
Steffen Wolf, Peter Merz
ATMOS
2008
187views Optimization» more  ATMOS 2008»
15 years 4 months ago
Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations
In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted...
Karl Nachtigall, Jens Opitz
COR
2006
94views more  COR 2006»
15 years 3 months ago
A comparison of two different formulations for arc routing problems on mixed graphs
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
Angel Corberán, Enrique Mota, José M...
MP
2011
14 years 10 months ago
Lifting for conic mixed-integer programming
Lifting is a procedure for deriving valid inequalities for mixed-integer sets from valid inequalities for suitable restrictions of those sets. Lifting has been shown to be very eï¬...
Alper Atamtürk, Vishnu Narayanan