Keyword: combinatorial analysis

Found 435 papers in total
The ordered open-end bin-packing problem
The ordered open-end bin-packing problem
2003,
We study a variant of the classical bin-packing problem, the ordered open-end...
The weighted consecutive ones problem for a fixed number of rows or columns
The weighted consecutive ones problem for a fixed number of rows or columns
2003,
The NP-hard weighted consecutive ones problem consists of converting a given...
Transformations of generalized asymmetric traveling salesman problems into simple asymmetric traveling salesman problems
Transformations of generalized asymmetric traveling salesman problems into simple asymmetric traveling salesman problems
2003,
The generalized traveling salesman problem (GTSP) is stated as follows. Given a...
A maximum flow algorithm using maximum adjacency ordering
A maximum flow algorithm using maximum adjacency ordering
2003,
Maximum adjacency (MA) ordering has effectively been applied to graph connectivity...
A new algorithm for reoptimizing shortest paths when the arc costs change
A new algorithm for reoptimizing shortest paths when the arc costs change
2003,
We propose the first algorithmic approach which reoptimizes the shortest paths when...
An O(n log n) procedure for identifying facets of the knapsack polytope
An O(n log n) procedure for identifying facets of the knapsack polytope
2003,
An O(n log n) procedure is presented for obtaining facets of the knapsack polytope by...
Local search for multiprocessor scheduling: How many moves does it take to a local optimum?
Local search for multiprocessor scheduling: How many moves does it take to a local optimum?
2003,
We analyze two local search algorithms for multiprocessor scheduling. The first...
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem
2003,
We consider the single machine dynamic total completion time scheduling problem. This...
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
2003,
This paper is concerned with the problem of unconstrained two-dimensional cutting of...
Waiting time distribution of the MAP/D/k system in discrete time – a more efficient algorithm
Waiting time distribution of the MAP/D/k system in discrete time – a more efficient algorithm
2003,
We show that the discrete time MAP/D/k presented by Chaudhry et al . has a special...
Computing an obnoxious anchored segment
Computing an obnoxious anchored segment
2003,
In this paper we address a maximin facility location problem for n points in the plane...
On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times
On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times
2003,
We consider the single machine, serial batching, total completion time scheduling...
The single-assignment hub covering problem: Models and linearizations
The single-assignment hub covering problem: Models and linearizations
2003,
We study the hub covering problem which, so far, has remained one of the unstudied hub...
A cutting plane algorithm for the unrelated parallel machine scheduling problem
A cutting plane algorithm for the unrelated parallel machine scheduling problem
2002,
This paper deals with the polyhedral structure of the scheduling problem R//C max ....
Optimisation modelling of industrial energy systems using the ‘Method for the analysis of INDustrial systems (MIND)’ introducing the effect of material storage
Optimisation modelling of industrial energy systems using the ‘Method for the analysis of INDustrial systems (MIND)’ introducing the effect of material storage
2002,
Strategic decisions regarding industrial energy systems should ideally involve the...
A reduction technique for weighted grouping problems
A reduction technique for weighted grouping problems
2002,
Weighted grouping problems are shown to have an equivalent reduced form, which is...
Common due date assignment and scheduling with ready times
Common due date assignment and scheduling with ready times
2002,
We consider the problem of scheduling a set of nonsimultaneously available jobs on one...
Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
2003,
In this paper, we study the feasibility problem of scheduling a set of start time...
Recent research directions in automated timetabling
Recent research directions in automated timetabling
2002,
The aim of this paper is to give a brief introduction to some recent approaches to...
An efficient complete enumeration method for network design problems and its applications
An efficient complete enumeration method for network design problems and its applications
2002,
In many network design problems, the best layout of components is searched considering...
Optimality in musical melodies and harmonic progressions: The travelling musician
Optimality in musical melodies and harmonic progressions: The travelling musician
2002,
A ‘chord’ is a collection of notes sounded simultaneously. A...
New rollout algorithms for combinatorial optimization problems
New rollout algorithms for combinatorial optimization problems
2002,
Rollout algorithms are new computational approaches used to determine near-optimal...
A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
2002,
We present a probabilistic greedy search method for combinatorial optimisation...
The school bus routing problem: A case study
The school bus routing problem: A case study
2002,
This paper describes a case study of the school bus routing problem. It is formulated...
Papers per page: