Keyword: combinatorial analysis

Found 435 papers in total
A highway corridor planning model: QROAD
A highway corridor planning model: QROAD
2002,
This model calculates an optimal investment plan for a highway corridor or number of...
Optimization of land use in afforestation areas using evolutionary self-organization
Optimization of land use in afforestation areas using evolutionary self-organization
2002,
This article presents a cellular automaton approach to the optimization of land use...
A dual criteria sequencing problem with earliness and tardiness penalties
A dual criteria sequencing problem with earliness and tardiness penalties
2002,
We consider the problem of sequencing n jobs on a single machine, with each job having...
Connections between cutting-pattern sequencing, VLSI design, and flexible machines
Connections between cutting-pattern sequencing, VLSI design, and flexible machines
2002,
The minimization of open stacks problem (MOSP) arises on the sequencing of a set of...
Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
2002,
We study the problem of nonpreemptively scheduling n jobs on m identical machines in...
Extending Graham's result on scheduling to other heuristics
Extending Graham's result on scheduling to other heuristics
2001,
This paper considers the off-line scheduling problem where a list of jobs must be...
Sensitivity analysis of scheduling algorithms
Sensitivity analysis of scheduling algorithms
2001,
We are interested in this work in studying the performances of static scheduling...
Minimizing makespan on a single batch processing machine with nonidentical job sizes
Minimizing makespan on a single batch processing machine with nonidentical job sizes
2001,
We deal with the problem of minimizing makespan on a single batch processing machine....
On-line algorithms for minimizing makespan on batch processing machines
On-line algorithms for minimizing makespan on batch processing machines
2001,
We consider the problem of scheduling jobs on-line on batch processing machines with...
Semi-on-line scheduling with ordinal data on two uniform machines
Semi-on-line scheduling with ordinal data on two uniform machines
2001,
We investigate the problem of semi-on-line scheduling of jobs on two uniform machines...
Efficient algorithm for the constrained two-dimensional cutting stock problem
Efficient algorithm for the constrained two-dimensional cutting stock problem
2001,
This paper considers the constrained two-dimensional cutting stock problem. Some...
A simple efficient approximation scheme for the restricted shortest path problem
A simple efficient approximation scheme for the restricted shortest path problem
2001,
In this paper we give a very simple fully polynomial approximation scheme for the...
Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
2001,
An intuitive solution-doubling argument establishes well known results concerning the...
Algorithms for the weight constrained shortest path problem
Algorithms for the weight constrained shortest path problem
2001,
Given a directed graph whose arcs have an associated cost, and associated weight, the...
Error bounds for the approximative solution of restricted planar location problems
Error bounds for the approximative solution of restricted planar location problems
2001,
Facility location problems in the plane play an important role in mathematical...
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
1999,
We study the problem of minimizing, the preemptive case, the number of late jobs on a...
A sum of disjoint products algorithm for reliability evaluation of flow networks
A sum of disjoint products algorithm for reliability evaluation of flow networks
2001,
This paper proposes a revised algorithm to evaluate the unreliability of a flow...
Approximate solutions to the turbine balancing problem
Approximate solutions to the turbine balancing problem
2001,
The turbine balancing problem (TBP) is an NP-Hard combinatorial optimization problem...
Applying combinatorial optimization metaheuristics to the golf scramble problem
Applying combinatorial optimization metaheuristics to the golf scramble problem
2000,
One typical golf tournament format is termed a ‘Scramble’, comprised of...
The multiple objective simulated annealing method: A tool for solving multiobjective combinatorial optimization problems
The multiple objective simulated annealing method: A tool for solving multiobjective combinatorial optimization problems
1999,
The success of modern heuristics (Simulated Annealing (SA), Tabu Search, Genetic...
Approximation algorithms for combinatorial multicriteria optimization problems
Approximation algorithms for combinatorial multicriteria optimization problems
2000,
The computational complexity of combinatorial multiple objective programming problems...
Another proof of polynomial-time recognizability of Delaunay graphs
Another proof of polynomial-time recognizability of Delaunay graphs
2000,
This paper presents an algorithm to judge whether a given graph is homeomorphic to...
Nested partitions method for global optimization
Nested partitions method for global optimization
2000,
We propose a new randomized method for solving global optimization problems. This...
Genetic algorithm in uncertain environments for solving stochastic programming problem
Genetic algorithm in uncertain environments for solving stochastic programming problem
2000,
Many real problems with uncertainties may often be formulated as Stochastic...
Papers per page: