Sciweavers

DISOPT
2008
138views more  DISOPT 2008»
13 years 11 months ago
An algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, ...
DISOPT
2008
85views more  DISOPT 2008»
13 years 11 months ago
How tight is the corner relaxation?
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
Matteo Fischetti, Michele Monaci
DISOPT
2008
66views more  DISOPT 2008»
13 years 11 months ago
George Dantzig's contributions to integer programming
Martin Grötschel, George L. Nemhauser
DISOPT
2008
59views more  DISOPT 2008»
13 years 11 months ago
More on online bin packing with two item sizes
We follow the work of [7] and study the online bin packing problem, where every item has one of two possible sizes which are known in advance. We focus on the parametric case, whe...
Leah Epstein, Asaf Levin
DISOPT
2008
69views more  DISOPT 2008»
13 years 11 months ago
An algorithm to increase the node-connectivity of a digraph by one
András Frank, László A. V&eac...
DISOPT
2008
118views more  DISOPT 2008»
13 years 11 months ago
Approximation algorithm for minimizing total latency in machine scheduling with deliveries
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
Asaf Levin, Michal Penn
DISOPT
2008
88views more  DISOPT 2008»
13 years 11 months ago
New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
The paper is concerned with the computational evaluation and comparison of a new family of conflict-based branching heuristics for evolved DPLL Satisfiability solvers. Such a fami...
Renato Bruni, Andrea Santori
DISOPT
2008
81views more  DISOPT 2008»
13 years 11 months ago
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
Matthias Köppe, Quentin Louveaux, Robert Weis...
DISOPT
2008
61views more  DISOPT 2008»
13 years 11 months ago
A generalization of the integer linear infeasibility problem
Akimichi Takemura, Ruriko Yoshida
DISOPT
2008
82views more  DISOPT 2008»
13 years 11 months ago
Note on pseudolattices, lattices and submodular linear programs
A pseudolattice L is a poset with lattice-type binary operations. Assuming that the pseudolattice permits a modular representation as a family of subsets of a set U with certain c...
Ulrich Faigle, Britta Peis