Keyword: computational analysis

Found 489 papers in total
An introduction to multi-parameter complexity analysis of discrete problems
An introduction to multi-parameter complexity analysis of discrete problems
2005,
A notion of multi-parameter complexity analysis of a discrete problem as the...
Integer-programming software systems
Integer-programming software systems
2005,
Recent developments in integer-programming software systems have tremendously improved...
A new complexity result on solving the Markov decision problem
A new complexity result on solving the Markov decision problem
2005,
We present a new complexity result on solving the Markov decision problem (MDP) with n...
Topological conditions for uniqueness of equilibrium in networks
Topological conditions for uniqueness of equilibrium in networks
2005,
Equilibrium flow in a physical network with a large number of users (e.g.,...
Primal–dual interior-point algorithms for semidefinite optimization based on a simple kernel function
Primal–dual interior-point algorithms for semidefinite optimization based on a simple kernel function
2005,
Interior-point methods (IPMs) for semidefinite optimization (SDO) have been studied...
Scheduling to minimize max flow time: Off-line and on-line algorithms
Scheduling to minimize max flow time: Off-line and on-line algorithms
2004,
We investigate the max flow time scheduling problem in the off-line and on-line...
Complexity and reducibility of the skip delivery problem
Complexity and reducibility of the skip delivery problem
2005,
In the skip delivery problem (SDP), a fleet of vehicles must deliver skips to a set of...
Semi-on-line parallel machines scheduling under known total and largest processing times
Semi-on-line parallel machines scheduling under known total and largest processing times
2005,
We consider the semi-on-line parallel machines scheduling problem with the known total...
Differential approximation of NP-hard problems with equal size feasible solutions
Differential approximation of NP-hard problems with equal size feasible solutions
2002,
In this paper, we focus on some specific optimization problems from graph theory,...
The computational complexity of the relative robust shortest path problem with interval data
The computational complexity of the relative robust shortest path problem with interval data
2004,
The paper deals with the relative robust shortest path problem in a directed arc...
On the structure and complexity of the 2-connected Steiner network problem in the plane
On the structure and complexity of the 2-connected Steiner network problem in the plane
2000,
We consider the problem of finding a minimum Euclidean length graph 2-connecting a set...
An algorithm for ranking quickest simple paths
An algorithm for ranking quickest simple paths
2005,
In this paper, an algorithm for ranking loopless paths in undirected networks,...
An analysis of lower bound procedures for the bin packing problem
An analysis of lower bound procedures for the bin packing problem
2005,
In this paper, we review LB2 and LB3 , two lower bounds for the bin packing problem...
A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
2004,
We consider the single machine, serial batching scheduling problem 1|prec; p j...
Inapproximability and a polynomially solvable special case of a network improvement problem
Inapproximability and a polynomially solvable special case of a network improvement problem
2004,
We consider a network improvement problem in which we wish to spend as little as...
Concurrent flowshop scheduling to minimize makespan
Concurrent flowshop scheduling to minimize makespan
2004,
This paper considers the concurrent flowshop scheduling problem with the makespan...
Comments on “Flow shop and open shop scheduling with a critical machine and two operations per job”
Comments on “Flow shop and open shop scheduling with a critical machine and two operations per job”
2004,
A recent paper addresses a flow-shop scheduling problem, where (i) each of the n jobs...
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
2000,
In this note, we give a 1.47-approximation algorithm for the preemtpive scheduling of...
Weight reduction problems with certain bottleneck objectives
Weight reduction problems with certain bottleneck objectives
2004,
This paper is concerned with bottleneck weight reduction problems (WRPs) stated as...
A note on the approximation of the asymmetric traveling salesman problem
A note on the approximation of the asymmetric traveling salesman problem
2004,
We show that some asymmetric traveling salesman problem (ATSP) instances are...
A concise survey of scheduling with time-dependent processing times
A concise survey of scheduling with time-dependent processing times
2004,
We consider a class of machine scheduling problems in which the processing time of a...
The complexity of two-job shop problems with multi-purpose unrelated machines
The complexity of two-job shop problems with multi-purpose unrelated machines
2004,
This paper deals with scheduling problems of two jobs with multi-purpose unrelated...
On solvability of functional equations and system of functional equations arising in dynamic programming
On solvability of functional equations and system of functional equations arising in dynamic programming
2004,
The purpose of this paper is to study solvability of two classes of functional...
Complexity results for flow-shop and open-shop scheduling problems with transportation delays
Complexity results for flow-shop and open-shop scheduling problems with transportation delays
2004,
We consider shop problems with transportation delays where not only the jobs on the...
Papers per page: