Search
Search Results
-
Progressively strengthening and tuning MIP solvers for reoptimization
This paper explores reoptimization techniques for solving sequences of similar mixed integer programs (MIPs) more effectively. Traditionally, these...
-
-
Design and Implementation of Scheduling Systems: Basic Concepts
Analyzing a scheduling problem and develo** a procedure for dealing with it on a regular basis is, in the real world, only part of the story. The...
-
Reoptimization framework and policy analysis for maritime inventory routing under uncertainty
We study a maritime inventory routing problem, in which shipments between production and consumption nodes are carried out by a fleet of vessels. The...
-
Reoptimization of minimum latency problem revisited: don’t panic when asked to revisit the route after local modifications
We study the reoptimization of the Minimum Latency problem (MLP) in metric space with respect to the modifications of adding (resp. removing) a...
-
What Lies Ahead?
This chapter describes various research and development topics that are likely to receive attention in the near future. A distinction is made between...
-
Design and Implementation of Scheduling Systems: More Advanced Concepts
This chapter focuses on a number of issues that have come up in recent years in the design, development, and implementation of scheduling systems....
-
Branch-and-Cut for the LOP
This chapter focuses on the approach for solving the LOP to optimality which can currently be seen as the most successful one. It is a...
-
Compact representation of near-optimal integer programming solutions
It is often useful in practice to explore near-optimal solutions of an integer programming problem. We show how all solutions within a given...
-
More Advanced General Purpose Procedures
The previous chapter covered the more established and the more widely used generic procedures. This chapter focuses on techniques that are more...
-
The Complexity of Approximation Reoptimization Algorithms for Discrete Optimization
The objective of postoptimality analysis and reoptimization using approximation methods is applying knowledge of the solution of the initial instance...
-
-
A solution framework for linear PDE-constrained mixed-integer problems
We present a general numerical solution method for control problems with state variables defined by a linear PDE over a finite set of binary or...
-
The Linear Ordering Polytope
So far we developed a general integer programming approach for solving the LOP. It was based on the canonical IP formulation with equations and...
-
Parameterized Dynamic Variants of Red-Blue Dominating Set
We introduce a parameterized dynamic version of the Red-Blue Dominating Set problem and its partial version. We prove the fixed-parameter...
-
-
A computational study of perspective cuts
The benefits of cutting planes based on the perspective function are well known for many specific classes of mixed-integer nonlinear programs with...
-
Combinatorial optimal control of semilinear elliptic PDEs
Optimal control problems (OCPs) containing both integrality and partial differential equation (PDE) constraints are very challenging in practice. The...
-
Weighted proximity search
Proximity search is an iterative method to solve complex mathematical programming problems. At each iteration, the objective function of the problem...
