Sciweavers

3250 search results - page 3 / 650
» An Algorithm to Solve a Linear Program
Sort
View
CADE
2011
Springer
12 years 7 months ago
Cutting to the Chase Solving Linear Integer Arithmetic
Abstract. We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut...
Dejan Jovanovic, Leonardo Mendonça de Moura
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
13 years 11 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
MOR
2002
94views more  MOR 2002»
13 years 7 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
SIAMJO
2000
116views more  SIAMJO 2000»
13 years 7 months ago
Computational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
John E. Mitchell
AAIM
2006
Springer
94views Algorithms» more  AAIM 2006»
13 years 11 months ago
Linear Programming Polytope and Algorithm for Mean Payoff Games
We investigate LP-polytopes generated by mean payoff games and their properties, including the existence of tight feasible solutions of bounded size. We suggest a new associated al...
Ola Svensson, Sergei G. Vorobyov