Journal: Discrete Optimization

Found 150 papers in total
Improved bounds for vehicle routing solutions
Improved bounds for vehicle routing solutions
2006,
We present lower bounds for the vehicle routing problem with and without split...
Sports tournaments, home–away assignments, and the break minimization problem
Sports tournaments, home–away assignments, and the break minimization problem
2006,
We consider the break minimization problem for fixing home–away assignments in...
New facets of the STS polytope generated from known facets of the ATS polytope
New facets of the STS polytope generated from known facets of the ATS polytope
2006,
While it had been known for a long time how to transform an asymmetric traveling...
A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
2006,
In this paper, we present a new class of polynomial length formulations for the...
Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs
Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs
2006,
The Asymmetric Travelling Salesman Problem with Replenishment Arcs (RATSP) is a new...
On the high multiplicity traveling salesman problem
On the high multiplicity traveling salesman problem
2006,
This paper considers a version of the traveling salesman problem where the cities are...
Iterative patching and the asymmetric traveling salesman problem
Iterative patching and the asymmetric traveling salesman problem
2006,
Although Branch-and-Bound (BnB) methods are among the most widely used techniques for...
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
2006,
We consider the standard dynamic program to solve the TSP. We then obtain...
Ordered optimal solutions and parametric minimum cut problems
Ordered optimal solutions and parametric minimum cut problems
2005,
In this paper, we present an algebraic sufficient condition for the existence of a...
A computational study of integer programming algorithms based on Barvinok's rational functions
A computational study of integer programming algorithms based on Barvinok's rational functions
2005,
This paper discusses five algorithms to solve linear programming problems that use the...
The two-dimensional bin packing problem with variable bin sizes and costs
The two-dimensional bin packing problem with variable bin sizes and costs
2005,
The two-dimensional variable sized bin packing problem (2DVSBPP) is the problem of...
A semidefinite optimization approach for the single-row layout problem with unequal dimensions
A semidefinite optimization approach for the single-row layout problem with unequal dimensions
2005,
The facility layout problem is concerned with the arrangement of a given number of...
One-way and round-trip center location problems
One-way and round-trip center location problems
2005,
In the classical p -center problem there is a set V of points (customers) in some...
Batched bin packing
Batched bin packing
2005,
We introduce and study the batched bin packing problem (BBPP), a bin packing problem...
Chvatal–Gomory–tier cuts for general integer programs
Chvatal–Gomory–tier cuts for general integer programs
2005,
In this paper, we introduce a new class of cutting planes called Chvatal–Gomory...
Scheduling a single machine to minimise a regular objective function under setup constraints
Scheduling a single machine to minimise a regular objective function under setup constraints
2005,
Motivated by industrial applications, we study the scheduling situation in which a set...
Facility location problems with uncertainty on the plane
Facility location problems with uncertainty on the plane
2005,
We consider single facility location problems (1-median and weighted 1-center) on a...
Near-optimal solutions to large-scale facility location problems
Near-optimal solutions to large-scale facility location problems
2005,
We investigate the solution of large-scale instances of the capacitated and...
The computational complexity of the elimination problem in generalized sports competitions
The computational complexity of the elimination problem in generalized sports competitions
2004,
Consider a sports competition among various teams playing against each other in pairs...
Lot-sizing with fixed charges on stocks: the convex hull
Lot-sizing with fixed charges on stocks: the convex hull
2004,
In this paper, we examine a variant of the uncapacitated lot-sizing model of...
Generating functions and duality for integer programs
Generating functions and duality for integer programs
2004,
We consider the integer program: max c′x | Ax=y;x ∈ N n ....
Comparisons and enhancement strategies for linearizing mixed 0–1 quadratic programs
Comparisons and enhancement strategies for linearizing mixed 0–1 quadratic programs
2004,
We present a linearization strategy for mixed 0–1 quadratic programs that...
When the greedy algorithm fails
When the greedy algorithm fails
2004,
We provide a characterization of the cases when the greedy algorithm may produce the...
Min-up/min-down polytopes
Min-up/min-down polytopes
2004,
In power generation and other production settings, technological constraints force...
Papers per page: