Sciweavers

48 search results - page 7 / 10
» disopt 2008
Sort
View
DISOPT
2008
89views more  DISOPT 2008»
13 years 10 months ago
A pricing problem under Monge property
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the larg...
Oktay Günlük
DISOPT
2008
85views more  DISOPT 2008»
13 years 10 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
89views more  DISOPT 2008»
13 years 10 months ago
Complexity of the min-max (regret) versions of min cut problems
This paper investigates the complexity of the min-max and min-max regret versions of the min s-t cut and min cut problems. Even if the underlying problems are closely related and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
DISOPT
2008
82views more  DISOPT 2008»
13 years 10 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
DISOPT
2008
118views more  DISOPT 2008»
13 years 10 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