Journal: Journal of Combinatorial Optimization

Found 352 papers in total
A note on special optimal batching structures to minimize total weighted completion time
A note on special optimal batching structures to minimize total weighted completion time
2007,
A batch is a subset of jobs which must be processed jointly in either serial or...
The use of edge-directions and linear programming to enumerate vertices
The use of edge-directions and linear programming to enumerate vertices
2007,
Given a list of vectors that contains directions of the edges of a given polytope...
Semi-online scheduling with ‘end of sequence’ information
Semi-online scheduling with ‘end of sequence’ information
2007,
We study a variant of classical scheduling, which is called scheduling with ‘end...
Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors
Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors
2007,
Circular blanks are often cut from silicon steel plates to make stators and rotors of...
A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem
A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem
2007,
In this paper, we propose an optimal algorithm for the Multiple-choice...
Improved approximation algorithms for metric MaxTSP
Improved approximation algorithms for metric MaxTSP
2007,
We present two polynomial-time approximation algorithms for the metric case of the...
On the number of local minima for the multidimensional assignment problem
On the number of local minima for the multidimensional assignment problem
2007,
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization...
Dynamic-objective particle swarm optimization for constrained optimization problems
Dynamic-objective particle swarm optimization for constrained optimization problems
2006,
This paper firstly presents a novel constraint-handling technique, called...
Performance ratios of the Karmarkar–Karp differencing method
Performance ratios of the Karmarkar–Karp differencing method
2007,
We consider the multiprocessor scheduling problem in which one must schedule n...
A simple linear time approximation algorithm for multi-processor job scheduling on four processors
A simple linear time approximation algorithm for multi-processor job scheduling on four processors
2007,
Multiprocessor job scheduling problem has become increasingly interesting, for both...
A multi-objective particle swarm for a flow shop scheduling problem
A multi-objective particle swarm for a flow shop scheduling problem
2007,
Flow shop problems as a typical manufacturing challenge have gained wide attention in...
Strong-mixed searching and pathwidth
Strong-mixed searching and pathwidth
2007,
In this paper, we propose a new search model, called strong-mixed search, which is a...
Inverse maximum flow problems under the weighted Hamming distance
Inverse maximum flow problems under the weighted Hamming distance
2006,
In this paper, we consider inverse maximum flow problem under the weighted Hamming...
The shortest path improvement problems under Hamming distance
The shortest path improvement problems under Hamming distance
2006,
In this paper, we consider the shortest path improvement problems under Hamming...
Optimal algorithms for uncovering synteny problem
Optimal algorithms for uncovering synteny problem
2006,
The syntenic distance between two genomes is the minimum number of fusions, fissions,...
The web proxy location problem in general tree of rings networks
The web proxy location problem in general tree of rings networks
2006,
The Web proxy location problem in general networks is an NP-hard problem. In this...
Scheduling with machine cost and rejection
Scheduling with machine cost and rejection
2006,
In this paper we consider the scheduling problem with machine cost and rejection...
Separating online scheduling algorithms with the relative worst order ratio
Separating online scheduling algorithms with the relative worst order ratio
2006,
The relative worst order ratio is a measure for the quality of online algorithms....
A note on the complexity of the problem of two-agent scheduling on a single machine
A note on the complexity of the problem of two-agent scheduling on a single machine
2006,
We consider a two-agent scheduling problem on a single machine, where the objective is...
The fastest itinerary in time-dependent decentralized travel information systems
The fastest itinerary in time-dependent decentralized travel information systems
2006,
A travel information system (TIS) provides customers with information about...
Polynomially solvable cases of the constant rank unconstrained quadratic 0–1 programming problem
Polynomially solvable cases of the constant rank unconstrained quadratic 0–1 programming problem
2006,
In this paper we consider the constant rank unconstrained quadratic 0–1...
Exact and heuristic algorithms for solving the generalized minimum filter placement problem
Exact and heuristic algorithms for solving the generalized minimum filter placement problem
2006,
We consider a problem of placing route-based filters in a communication network to...
Optimal testing and repairing a failed series system
Optimal testing and repairing a failed series system
2006,
We consider a series repairable system that includes n components and assume that it...
An adaptive algorithm for active queue management
An adaptive algorithm for active queue management
2006,
This paper proposes an adaptive proportional integral (API) algorithm for active queue...
Papers per page: