Keyword: combinatorial analysis

Found 435 papers in total
Meta-heuristics from nature for the loop layout design problem
Meta-heuristics from nature for the loop layout design problem
2006,
The loop-layout design problem (LLDP) arises when the machines in a flexible...
The competitive salesman problem on a network: a worst-case approach
The competitive salesman problem on a network: a worst-case approach
2006,
We provide a complexity analysis of the problem of optimal routing of a server on a...
Scheduling with step-improving processing times
Scheduling with step-improving processing times
2006,
We consider the scheduling problem of minimizing the makespan on a single machine with...
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...
Metaheuristics in combinatorial optimization
Metaheuristics in combinatorial optimization
2005,
The emergence of metaheuristics for solving difficult combinatorial optimization...
Order preserving reductions and polynomial improving paths
Order preserving reductions and polynomial improving paths
2006,
This paper shows that neighborhood transformations and data-independent order...
On complexity of multistage stochastic programs
On complexity of multistage stochastic programs
2006,
In this paper we derive estimates of the sample sizes required to solve a multistage...
The complexity of customer order scheduling problems on parallel machines
The complexity of customer order scheduling problems on parallel machines
2005,
This paper considers scheduling problems where a set of jobs (customer order) is...
A two-dimensional vector packing model for the efficient use of coil cassettes
A two-dimensional vector packing model for the efficient use of coil cassettes
2005,
We consider the problem of efficiently packing steel products, known as coils, into...
Improved algorithm for maximizing service of carousel storage
Improved algorithm for maximizing service of carousel storage
2005,
We consider a problem of maximizing the service of a carousel storage system from...
Improved dynamic programs for some batching problems involving the maximum lateness criterion
Improved dynamic programs for some batching problems involving the maximum lateness criterion
2000,
We study four scheduling problems involving the maximum lateness criterion and an...
Traveling salesman problems with profits
Traveling salesman problems with profits
2005,
Traveling salesman problems with profits (TSPs with profits) are a generalization of...
Models and methods for standardization problems
Models and methods for standardization problems
2005,
When designing an information system, the so-called “Standardization...
Selected combinatorial problems of computational biology
Selected combinatorial problems of computational biology
2005,
Recently we observe a great breakthrough in biology connected with the studies on...
Auctions with bidder-determined allowable combinations
Auctions with bidder-determined allowable combinations
2005,
Combinatorial auctions are desirable as they enable bidders to express the synergistic...
On the k-cut problem
On the k-cut problem
2000,
Given a graph with nonnegative edge-weights, let f(k) be the value of an optimal...
On approximation of the submodular set cover problem
On approximation of the submodular set cover problem
1999,
We design a primal–dual heuristic for the submodular set cover problem and...
A new scaling algorithm for the minimum cost network flow problem
A new scaling algorithm for the minimum cost network flow problem
1999,
In this paper, we present a new polynomial time algorithm for solving the minimum cost...
Linear-shaped partition problems
Linear-shaped partition problems
2000,
We establish the polynomial-time solvability of a class of vector partition problems...
Linear programming with variable matrix entries
Linear programming with variable matrix entries
2005,
We consider linear programming (continuous or integer) where some matrix entries are...
An exact method based on Lagrangian decomposition for the 0–1 quadratic knapsack problem
An exact method based on Lagrangian decomposition for the 0–1 quadratic knapsack problem
2004,
The 0–1 quadratic knapsack problem (QKP) consists in maximizing a quadratic...
A mixed integer formulation for maximal covering by inclined parallelograms
A mixed integer formulation for maximal covering by inclined parallelograms
2004,
In this paper, we introduce a zero–one mixed integer formulation for a maximal...
Single machine parallel batch scheduling subject to precedence constraints
Single machine parallel batch scheduling subject to precedence constraints
2004,
We consider the single machine parallel batch scheduling problems to minimize makespan...
Proactive release procedures for just-in time job shop environments, subject to machine failures
Proactive release procedures for just-in time job shop environments, subject to machine failures
2004,
In this paper, we consider just-in-time job shop environments (job shop problems with...
Papers per page: