Sciweavers

1274 search results - page 1 / 255
» N-fold integer programming
Sort
View
DAM
2002
75views more  DAM 2002»
13 years 4 months ago
Cutting planes in integer and mixed integer programming
Hugues Marchand, Alexander Martin, Robert Weismant...
PLDI
1994
ACM
13 years 8 months ago
Division by Invariant Integers using Multiplication
Integer division remains expensive on today's processors as the cost of integer multiplication declines. We present code sequences for division by arbitrary nonzero integer c...
Torbjörn Granlund, Peter L. Montgomery
RIVF
2008
13 years 6 months ago
On the bounded integer programming
The best upper time bound for solving the Bounded Integer Programming (BIP) up to now is poly()
Thân Quang Khoát
IPCO
2007
140views Optimization» more  IPCO 2007»
13 years 6 months ago
Cuts for Conic Mixed-Integer Programming
A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learnin...
Alper Atamtürk, Vishnu Narayanan
EOR
2006
104views more  EOR 2006»
13 years 4 months ago
An linear programming based lower bound for the simple assembly line balancing problem
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
Marc Peeters, Zeger Degraeve