Orlin James B.

James B. Orlin

Information about the author James B. Orlin will soon be added to the site.
Found 48 papers in total
Scale-invariant clustering with minimum volume ellipsoids
Scale-invariant clustering with minimum volume ellipsoids
2008
This paper develops theory and algorithms concerning a new metric for clustering data....
ϵ-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems
ϵ-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems
2008
Motivated by the need to deal with imprecise data in real-world optimization problems,...
Lexicographically minimum and maximum load linear programming problems
Lexicographically minimum and maximum load linear programming problems
2007
In this paper, we introduce the lexicographically minimum load linear programming...
A multi-exchange heuristic for the single-source capacitated facility location problem
A multi-exchange heuristic for the single-source capacitated facility location problem
2004
We present a very large-scale neighborhood (VLSN) search algorithm for the capacitated...
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...
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...
Solving real-life locomotive-scheduling problems
Solving real-life locomotive-scheduling problems
2005
In the locomotive-scheduling problem (or the locomotive-assignment problem) we must...
Creating very large scale neighborhoods out of smaller ones by compounding moves
Creating very large scale neighborhoods out of smaller ones by compounding moves
2006
This paper discusses neighborhood search algorithms where the size of the neighborhood...
Fast neighborhood search for the single machine total weighted tardiness problem
Fast neighborhood search for the single machine total weighted tardiness problem
2006
Most successful heuristics for solving I||∑w i T i are based on swap...
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
2004
We consider a convex, or nonlinear, separable minimization problem with constraints...
A neighborhood search algorithm for the combined through and fleet assignment model with time windows
A neighborhood search algorithm for the combined through and fleet assignment model with time windows
2004
The fleet assignment model (FAM) for an airline assigns fleet types to a set of flight...
Solving the convex cost integer dual network flow
Solving the convex cost integer dual network flow
2003
In this paper, we consider an integer convex optimization problem where the objective...
Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem
Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem
1997
The paper presents two new combinatorial algorithms for the generalized circulation...
A composite very large-scale neighbourhood structure for the capacitated minimum spanning tree problem
A composite very large-scale neighbourhood structure for the capacitated minimum spanning tree problem
2003
The capacitated minimum spanning tree (CMST) problem is to find a minimum cost...
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
2002
This paper investigates minimum time and minimum cost path problems in street networks...
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
2002
This paper investigates minimum time and minimum cost path problems in street networks...
Dynamic shortest paths minimizing travel times and costs
Dynamic shortest paths minimizing travel times and costs
2003
In this paper, we study dynamic shortest path problems that determine a shortest path...
Combinatorial algorithms for inverse network flow problems
Combinatorial algorithms for inverse network flow problems
2002
An inverse optimization problem is defined as follows: Let S denote the set of...
On multiroute maximum flows in networks
On multiroute maximum flows in networks
2002
Let G = (N, A) be a network with a designated source node s , a designated sink node t...
New polynomial-time cycle-canceling algorithms for minimum-cost flows
New polynomial-time cycle-canceling algorithms for minimum-cost flows
2000
The cycle-canceling algorithm is one of the earliest algorithms to solve the...
Inverse optimization
Inverse optimization
2001
In this paper, we study inverse optimization problems defined as follows. Let S denote...
A fast scaling algorithm for minimizing separable convex functions subject to chain constraints
A fast scaling algorithm for minimizing separable convex functions subject to chain constraints
2001
We consider the problem of minimizing Σ j∈N C j ( x j ), subject to the...
Very large-scale neighborhood search
Very large-scale neighborhood search
2000
Neighborhood search algorithms are often the most effective approaches available for...
A greedy genetic algorithm for the quadratic assignment problem
A greedy genetic algorithm for the quadratic assignment problem
2000
The Quadratic Assignment Problem (QAP) is one of the classical combinatorial...
Papers per page: