Now showing items 1-9 of 9
Solving school bus routing problems through integer programming
(Palgrave Macmillan Ltd., 2007)
In this paper, an exact solution approach is described for solving a real-life school bus routing problem (SBRP) for transporting the students of an elementary school throughout central Ankara, Turkey. The problem is ...
A global error bound for quadratic perturbation of linear programs
We prove a global error bound result on the quadratic perturbation of linear programs. The error bound is stated in terms of function values.
Formulations and valid inequalities for the heterogeneous vehicle routing problem
We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first four based on Miller-Tucker-Zemlin ...
Scheduling with tool changes to minimize total completion time: a study of heuristics and their performance
(John Wiley & Sons, Inc., 2003)
The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a ...
Optimal oblivious routing under linear and ellipsoidal uncertainty
In telecommunication networks, a common measure is the maximum congestion (i.e., utilization) on edge capacity. As traffic demands are often known with a degree of uncertainty, network management techniques must take into ...
Generalized column generation for linear programming
(Institute for Operations Research and the Management Sciences (INFORMS), 2002)
Column generation is a well-known and widely practiced technique for solving linear programs with too many variables or constraints to include in the initial formulation explicitly. Instead, the required column information ...
A derivation of Lovász' theta via augmented lagrange duality
(E D P Sciences, 2003)
A recently introduced dualization technique for binary linear programs with equality constraints, essentially due to Poljak et al. , and further developed in Lemar´echal and Oustry , leads to simple alternative ...
On the single-assignment p-hub center problem
We study the computational aspects of the single-assignment p-hub center problem on the basis of a basic model and a new model. The new model's performance is substantially better in CPU time than different linearizations ...
Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
We implement several warm-start strategies in interior-point methods for linear programming (LP). We study the situation in which both the original LP instance and the perturbed one have exactly the same dimensions. We ...