The "Capacitated lot sizing problem with setup carry-over" is based ort the well known "Capacitated lot sizing problem" and incorporates the possibility of preserving a setup-state from a period to the following. Sox and Gao [2] decompose their formulation of the first one (GCLP1) by Lagrangian...

This paper addresses the robust spanning tree problem with interval data, i.e. the case of classical minimum spanning tree problem when edge weights are not fixed but take their values from some intervals associated with edges. The problem consists in finding a spanning tree that minimizes...

This paper addresses the robust shortest path problem with interval data, i.e. the case of classical shortest path problem with given source and sink when arc weights are not fixed but take their values from some intervals associated with arcs. The problem consists in finding a shortest path...

Combinatorial auctions permitting bids on bundles of items have been developed to remedy the exposure problem associated with single-item auctions. Given winning bundle prices a set of item prices is called market clearing or equilibrium if all the winning bids are greater than or equal and if...

The sales territory alignment problem deals with the question of how to align a number of sales coverage units (usually zip-codes or political districts) to sales territories. These sales territories are usually aligned in a way that they are almost balanced relative to one or several attributes...

A flow line consists of a sequence of work places (or stations) through which one or more producta (or models) move one-way in order to be processed. Each model requires specific Operations which must be performed in a predefined Order. To be able to do so, the stations must be equipped with...

Complexity proofs often restrict themselves to stating that the problem at hand is a generalization of some other intractable problem, This proof technique relies on the widely accepted assumptions that complexity results hold regardless of the model formulation used to represent the problem and...

NP-completeness and other complexity proofs often merely State that the problem at hand is a generalization of some other intractable problem. This proof technique relies on the widely accepted assumption that complexity results hold regardless of the model formulation used to represent the...

This paper deals with lot sizing and scheduling for a single-stage production System where setup costs and times are sequence dependent. A large bücket mixed integer programming (MIP) model is formulated which considers only efficient sequences. A tailor-made enumeration method of the...

We examine the linear-quadratic (LQ) approximation of non-linear stochastic dynamic optimization problems in macroeconomics, in particular for monetary policy. We make four main contributions: first, we draw attention to a general Hamiltonian framework for LQ approximation due to Magill (1977)....