Search
Search Results
-
Testing cut generators for mixed-integer linear programming
In this paper, a methodology for testing the accuracy and strength of cut generators for mixed-integer linear programming is presented. The procedure...
-
A Practical Approach for Robust and Flexible Vehicle Routing Using Metaheuristics and Monte Carlo Sampling
In this paper, we investigate how robust and flexible solutions of a number of stochastic variants of the capacitated vehicle routing problem can be...
-
Advanced Concepts in Systems Design
This chapter focuses on a number of issues that have come up in recent years in the design, development, and implementation of planning and...
-
Management of water resource systems in the presence of uncertainties by nonlinear approximation techniques and deterministic sampling
Two methods of approximate solution are developed for T -stage stochastic optimal control (SOC) problems, aimed at obtaining finite-horizon management...
-
The Stochastic Vehicle Routing Problem for Minimum Unmet Demand
In this chapter, we are interested in routing vehicles to minimize unmet demand with uncertain demand and travel time parameters. Such a problem...
-
Zwei auf einen Streich: Optimierte dynamische Einsatzplanung für Gelbe Engel und Lastenaufzüge
We present a unified model for two dynamic dispatching problems: the dynamic dispatching of automobile service vehicles at the German Automobile...
-
A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
This paper presents a planning problem faced by many ship** companies dealing with the transport of bulk products. These ship** companies...
-
Approximation algorithms for a vehicle routing problem
In this paper we investigate a vehicle routing problem motivated by a real-world application in cooperation with the German Automobile Association...
-
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...
-
Bi-Objective Assignment Problem
Keywords Direct Methods Two-Phase Methods First Step Second Step Heuristic Methods Preliminaries Determination of PE(λ(l)), l = 1, …, L...
-
Two-stage stochastic hierarchical multiple risk problems: models and algorithms
In this paper, we consider a class of two-stage stochastic risk management problems, which may be stated as follows. A decision-maker determines a...
-
Stochastic Bilevel Programs
Keywords Principal Features of Bilevel Programs Examples of Bilevel Programs Properties of the Stochastic Bilevel Program Algorithms for Stochastic...
-
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
We consider the generalized version of the classical Minimum Spanning Tree problem where the nodes of a graph are partitioned into clusters and...
-
Efficient sampling in approximate dynamic programming algorithms
Dynamic Programming (DP) is known to be a standard optimization tool for solving Stochastic Optimal Control (SOC) problems, either over a finite or...
-
Convergent Lagrangian and domain cut method for nonlinear knapsack problems
The nonlinear knapsack problem, which has been widely studied in the OR literature, is a bounded nonlinear integer programming problem that...
-
Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming
This paper describes a heuristic for 0-1 mixed-integer linear programming problems, focusing on “stand-alone” implementation. Our approach is built...
-
Interior-point methods for nonconvex nonlinear programming: regularization and warmstarts
In this paper, we investigate the use of an exact primal-dual penalty approach within the framework of an interior-point method for nonconvex...
-
An exact primal–dual penalty method approach to warmstarting interior-point methods for linear programming
One perceived deficiency of interior-point methods in comparison to active set methods is their inability to efficiently re-optimize by solving...
-
A parallel multigrid accelerated Poisson solver for ab initio molecular dynamics applications
In this paper we present an application for a parallel multigrid solver in 3D to solve the Coulomb problem for the charge self interaction in a...
-
Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups
A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a...