Journal: Journal of Combinatorial Optimization

Found 352 papers in total
New algorithms for online rectangle filling with k‐lookahead
New algorithms for online rectangle filling with k‐lookahead
2011,
We study the online rectangle filling problem which arises in channel aware scheduling...
Compact labelings for efficient first‐order model‐checking
Compact labelings for efficient first‐order model‐checking
2011,
We consider graph properties that can be checked from labels, i.e., bit sequences, of...
Cost sharing and strategy-proof mechanisms for set cover games
Cost sharing and strategy-proof mechanisms for set cover games
2010,
We develop for set cover games several general cost-sharing methods that are...
On-line machine scheduling with batch setups
On-line machine scheduling with batch setups
2010,
We study a class of scheduling problems with batch setups for the online-list and...
Incremental facility location problem and its competitive algorithms
Incremental facility location problem and its competitive algorithms
2010,
We consider the incremental version of the k -Facility Location Problem, which is a...
Separator-based data reduction for signed graph balancing
Separator-based data reduction for signed graph balancing
2010,
Polynomial-time data reduction is a classical approach to hard graph problems....
An approximation algorithm for the k-level capacitated facility location problem
An approximation algorithm for the k-level capacitated facility location problem
2010,
We consider the k -level capacitated facility location problem ( k -CFLP), which is a...
Semi-online scheduling with known maximum job size on two uniform machines
Semi-online scheduling with known maximum job size on two uniform machines
2010,
In this paper, we investigate the semi-online scheduling problem with known maximum...
Strong formulation for the spot 5 daily photograph scheduling problem
Strong formulation for the spot 5 daily photograph scheduling problem
2010,
Earth observation satellites, such as the SPOT 5, take photographs of the earth...
Polynomial time approximation schemes for minimum disk cover problems
Polynomial time approximation schemes for minimum disk cover problems
2010,
The following planar minimum disk cover problem is considered in this paper: given a...
On the max-weight edge coloring problem
On the max-weight edge coloring problem
2010,
We study the following generalization of the classical edge coloring problem: Given a...
Online scheduling with a buffer on related machines
Online scheduling with a buffer on related machines
2010,
Online scheduling with a buffer is a semi-online problem which is strongly related to...
Finding checkerboard patterns via fractional 0– 1 programming
Finding checkerboard patterns via fractional 0– 1 programming
2010,
Biclustering is a data mining technique used to simultaneously partition the set of...
Periodic complementary binary sequences and combinatorial optimization algorithms
Periodic complementary binary sequences and combinatorial optimization algorithms
2010,
We establish a new formalism for problems pertaining to the periodic autocorrelation...
A note on hierarchical scheduling on two uniform machines
A note on hierarchical scheduling on two uniform machines
2010,
This paper studies online hierarchical scheduling on two uniform machines with the...
A Lagrangian bound for many-to-many assignment problems
A Lagrangian bound for many-to-many assignment problems
2010,
A simple procedure to tighten the Lagrangian bounds is proposed. The approach is...
Scheduling internal audit activities: a stochastic combinatorial optimization problem
Scheduling internal audit activities: a stochastic combinatorial optimization problem
2010,
The problem of finding the optimal timing of audit activities within an organisation...
A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions
A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions
2010,
Given a graph G =( V , E ) with edge weights w e ∈ℝ, the optimum cooperation...
An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
2010,
In telecommunication networks design the problem of obtaining optimal (arc or node)...
Keeping partners together: algorithmic results for the hospitals/residents problem with couples
Keeping partners together: algorithmic results for the hospitals/residents problem with couples
2010,
The Hospitals/Residents problem with Couples (HRC) is a generalisation of the...
Algorithms for storage allocation based on client preferences
Algorithms for storage allocation based on client preferences
2010,
We consider a packing problem arising in storage management of Video on Demand (VoD)...
Just-in-time scheduling with controllable processing times on parallel machines
Just-in-time scheduling with controllable processing times on parallel machines
2010,
We study scheduling problems with controllable processing times on parallel machines....
Complexity analysis for maximum flow problems with arc reversals
Complexity analysis for maximum flow problems with arc reversals
2010,
We provide a comprehensive study on network flow problems with arc reversal...
Lexicographically minimizing axial motions for the Euclidean TSP
Lexicographically minimizing axial motions for the Euclidean TSP
2010,
A variant of the Euclidean traveling salesman problem (TSP) is defined and studied. In...
Papers per page: