Journal: Journal of Combinatorial Optimization

Found 352 papers in total
Min-energy voltage allocation for tree-structured tasks
Min-energy voltage allocation for tree-structured tasks
2006,
We study job scheduling on processors capable of running at variable voltage/speed to...
A ‘maximum node clustering’ problem
A ‘maximum node clustering’ problem
2006,
In this note we introduce a graph problem, called Maximum Node Clustering (MNC). We...
Some further results on minimum distribution cost flow problems
Some further results on minimum distribution cost flow problems
2006,
Manufacturing network flow (MNF) is a generalized network model that can model more...
A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
2006,
We study the problem of (off-line) broadcast scheduling in minimizing total flow time...
Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
2006,
This paper considers the Cardinality Constrained Quadratic Knapsack Problem (QKP) and...
On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
2006,
The paper addresses the relay node placement problem in two-tiered wireless sensor...
Efficient point coverage in wireless sensor networks
Efficient point coverage in wireless sensor networks
2006,
We study minimum-cost sensor placement on a bounded 3D sensing field, R , which...
Strengthened 0–1 linear formulation for the daily satellite mission planning
Strengthened 0–1 linear formulation for the daily satellite mission planning
2006,
In this paper, we compare several 0–1 linear programs for solving the satellite...
Coverage by directional sensors in randomly deployed wireless sensor networks
Coverage by directional sensors in randomly deployed wireless sensor networks
2006,
We study a novel ‘coverage by directional sensors’ problem with tunable...
Multiple objective optimization of bluetooth scatternets
Multiple objective optimization of bluetooth scatternets
2006,
Bluetooth technology permits wireless interconnection for local area communication....
Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks
Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks
2006,
In this paper, we present three schemes to solve minimum total energy broadcasting...
Minimum power assignment in wireless ad hoc networks with spanner property
Minimum power assignment in wireless ad hoc networks with spanner property
2006,
Power assignment for wireless ad hoc networks is to assign a power for each wireless...
A hybrid genetic–GRASP algorithm using Langrangean relaxation for the traveling salesman problem
A hybrid genetic–GRASP algorithm using Langrangean relaxation for the traveling salesman problem
2005,
Hybridization techniques are very effective for the solution of combinatorial...
Preemptive machine covering on parallel machines
Preemptive machine covering on parallel machines
2005,
This paper investigates the preemptive parallel machine scheduling to maximize the...
Ant colony system for a dynamic vehicle routing problem
Ant colony system for a dynamic vehicle routing problem
2005,
An abundant literature on vehicle routing problems is available. However, most of the...
A note on balancedness of dominating set games
A note on balancedness of dominating set games
2005,
In this paper we consider the balancedness of dominating set games, introduced by...
On split-coloring problems
On split-coloring problems
2005,
We study a new coloring concept which generalizes the classical vertex coloring...
Efficient solutions for special zero–one programming problems
Efficient solutions for special zero–one programming problems
2005,
A zero–one linear programming is under consideration. It has been proved that...
A framework for the complexity of high-multiplicity scheduling problems
A framework for the complexity of high-multiplicity scheduling problems
2005,
The purpose of this note is to propose a complexity framework for the analysis of high...
Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary knapsack problem
Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary knapsack problem
2005,
In the binary single constraint Knapsack Problem, denoted KP, we are given a knapsack...
On-line scheduling algorithms for a batch machine with finite capacity
On-line scheduling algorithms for a batch machine with finite capacity
2005,
We study the problem of on-line scheduling jobs with release dates on a batch machine...
Efficient job scheduling algorithms with multi-type contentions
Efficient job scheduling algorithms with multi-type contentions
2005,
In this paper, we consider an interesting generalization of the classic job scheduling...
Order consolidation for batch processing
Order consolidation for batch processing
2005,
We consider the batch processing of orders where either whole or part of a single...
A tighter extra-resource analysis of online deadline scheduling
A tighter extra-resource analysis of online deadline scheduling
2005,
This paper is concerned with online algorithms for scheduling jobs with deadlines on a...
Papers per page: