Search Results - subject:"mixed integer programming."

Lot-sizing with production and delivery time windows

Wolsey, Laurence A. (contributor) - 2005

: production time windows, lot-sizing, mixed integer programming We are most grateful for the hospitality of IASI, Rome, where part …) DP algorithm for the general cost case. In addition various mixed integer programming formulations for the two variants … look both for polynomial time optimization algorithms and also tight mixed integer programming formulations possibly with …

Persistent link: https://www.econbiz.de/10003288384

On lot streaming with multiple products

Feldmann, Martin; Biskup, Dirk - 2005

Persistent link: https://www.econbiz.de/10003387230

Mechanism design for multiple item procurement using a distributed ellipsoid algorithm

Miller, Andrew J. (contributor); … - 2005

Persistent link: https://www.econbiz.de/10003311951

Round robin tournaments and three index assignment

Briskorn, Dirk; Drexl, Andreas; Spieksma, Frits C. R. - 2005

In general scheduling a sports league is a difficult combinatorial optimization problem. We study some variants of round robin tournaments and analyze the relationship with the planar three index assignment problem. The complexity of scheduling a round robin tournaments is settled by a reduction...

Persistent link: https://www.econbiz.de/10011723806

Non-linear anonymous pricing in combinatorial auctions

Drexl, Andreas; Jörnsten, Kurt O.; Knof, Diether - 2005

mixed-integer programming formulation of the pricing problem. The procedure is computationally tested using instances of the …

Persistent link: https://www.econbiz.de/10011724100

Lot-Sizing with Production and Delivery Time Windows

Wolsey, Laurence A. - 2005

We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be produced within a given time interval, we derive tight extended formulations for both the constant capacity and...

Persistent link: https://www.econbiz.de/10014063633

Nested Maximin Latin Hypercube Designs in Two Dimensions

Husslage, Bart; van Dam, Edwin; Hertog, Dirk den - 2005

In black box evaluation and optimization, Latin hypercube designs play an important role. When dealing with multiple black box functions, the need often arises to construct designs for all black boxes jointly, instead of individually. These so-called nested designs consist of two different...

Persistent link: https://www.econbiz.de/10014063856

Fast Fourier Transform and its Applications to Integer Knapsack Problems

Nesterov, Yurii - 2005

In this paper we suggest a new efficient technique for solving integer knapsack problems. Our algorithms can be seen as application of Fast Fourier Transform to generating functions of integer polytopes. Using this approach, it is possible to count the number of boolean solutions of a single...

Persistent link: https://www.econbiz.de/10014066592

Maximin Latin Hypercube Designs in Two Dimensions

van Dam, Edwin; Husslage, Bart; Hertog, Dirk den; … - 2005

The problem of finding a maximin Latin hypercube design in two dimensions can be described as positioning n non-attacking rooks on an n x n chessboard such that the minimal distance between pairs of rooks is maximized. Maximin Latin hypercube designs are important for the approximation and...

Persistent link: https://www.econbiz.de/10014066712

One-Dimensional Nested Maximin Designs

van Dam, Edwin; Husslage, Bart; Hertog, Dirk den - 2005

The design of computer experiments is an important step in black box evaluation and optimization processes. When dealing with multiple black box functions the need often arises to construct designs for all black boxes jointly, instead of individually. These so-called nested designs are used to...

Persistent link: https://www.econbiz.de/10014069178