Journal: Journal of Combinatorial Optimization

Found 352 papers in total
A tighter formulation of the p-median problem
A tighter formulation of the p-median problem
2010,
Given a set of clients and a set of potential sites for facilities, the p -median...
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
2010,
We consider the scheduling of n family jobs with release dates on m identical parallel...
Worst-case analysis for on-line service policies
Worst-case analysis for on-line service policies
2010,
This paper considers an on-line scheduling problem occurred in a service system with...
Flows with unit path capacities and related packing and covering problems
Flows with unit path capacities and related packing and covering problems
2009,
Since the seminal work of Ford and Fulkerson in the 1950s, network flow theory is one...
A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
2009,
In the connected facility location (ConFL) problem, we are given a graph G =( V , E )...
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
2009,
In this paper, we study the problem of planning a timetable for passenger trains...
The canadian traveller problem and its competitive analysis
The canadian traveller problem and its competitive analysis
2009,
From the online point of view, we study the Canadian Traveller Problem (CTP), in which...
Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
2009,
In this article, we consider the non–resumable case of the single machine...
Multiple phase neighborhood Search-GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
Multiple phase neighborhood Search-GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
2009,
In this paper, a new modified version of Greedy Randomized Adaptive Search Procedure...
Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
2009,
In this paper we develop a branch–and–bound algorithm for solving a...
Lower bounds and a tabu search algorithm for the minimum deficiency problem
Lower bounds and a tabu search algorithm for the minimum deficiency problem
2009,
An edge coloring of a graph G =( V , E ) is a function c : E ⇒ℕ that assigns...
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
2009,
We consider a single batch machine on-line scheduling problem with delivery times. In...
An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems
An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems
2009,
In this paper, we propose an exact method for solving a special integer program...
A nonlinear optimization methodology for VLSI fixed-outline floorplanning
A nonlinear optimization methodology for VLSI fixed-outline floorplanning
2008,
Floorplanning is a critical step in the physical design of VLSI circuits. The...
Packing trees in communication networks
Packing trees in communication networks
2008,
Given an undirected edge–capacitated graph and given (possibly) different...
An efficient generalized network-simplex-based algorithm for manufacturing network flows
An efficient generalized network-simplex-based algorithm for manufacturing network flows
2008,
Fang and Qi introduced a new generalized network flow model called manufacturing...
A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
2008,
The vehicle routing problem with pickups and deliveries (VRPPD) extends the vehicle...
Simplest optimal guillotine cutting patterns for strips of identical circles
Simplest optimal guillotine cutting patterns for strips of identical circles
2008,
The manufacturing industry often uses the cutting and stamping process to divide stock...
The hierarchical model for load balancing on two machines
The hierarchical model for load balancing on two machines
2008,
Following previous work, we consider the hierarchical load balancing model on two...
Reduced costs propagation in an efficient implicit enumeration for the 0–1 multidimensional knapsack problem
Reduced costs propagation in an efficient implicit enumeration for the 0–1 multidimensional knapsack problem
2008,
In a previous work we proposed a variable fixing heuristics for the 0–1...
On lazy bureaucrat scheduling with common deadlines
On lazy bureaucrat scheduling with common deadlines
2008,
Lazy bureaucrat scheduling is a new class of scheduling problems introduced by Arkin...
An exponential (matching based) neighborhood for the vehicle routing problem
An exponential (matching based) neighborhood for the vehicle routing problem
2008,
We introduce an exponential neighborhood for the Vehicle Routing Problem with unit...
Online bin packing of fragile objects with application in cellular networks
Online bin packing of fragile objects with application in cellular networks
2007,
We study a specific bin packing problem which arises from the channel assignment...
The wireless network jamming problem
The wireless network jamming problem
2007,
In adversarial environments, disabling the communication capabilities of the enemy is...
Papers per page: