327 search results - page 22 / 66 » Cutting planes in integer and mixed integer programming |
105
click to vote
CP
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
ALDT
2009
Springer
15 years 5 months ago
2009
Springer
In this article we develop an indirect approach for assessing criteria significance weights from the robustness of the significance that a decision maker acknowledges for his pai...
101
click to vote
INFORMS
2006
15 years 1 months ago
2006
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
IJMTM
2011
14 years 8 months ago
2011
: In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled fro...
157
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...