Keyword: combinatorial optimization

Found 3184 papers in total
A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem
A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem
2012,
Advances in information technology and telecommunications, together with...
Exact Routing in Large Road Networks Using Contraction Hierarchies
Exact Routing in Large Road Networks Using Contraction Hierarchies
2012,
Contraction hierarchies are a simple approach for fast routing in road networks. Our...
An adapted heuristic approach for a clustered traveling salesman problem with loading constraints
An adapted heuristic approach for a clustered traveling salesman problem with loading constraints
2012,
The joint optimization of routing and loading operations is crucial to fully optimize...
Pricing and setup/closedown policies in unobservable queues with strategic customers
Pricing and setup/closedown policies in unobservable queues with strategic customers
2012,
In this paper we study unobservable Markovian queueing systems with three types of...
An intermodal multicommodity routing problem with scheduled services
An intermodal multicommodity routing problem with scheduled services
2012,
We study a multicommodity routing problem faced by an intermodal service operator that...
Edge‐based semidefinite programming relaxation of sensor network localization with lower bound constraints
Edge‐based semidefinite programming relaxation of sensor network localization with lower bound constraints
2012,
In this paper, we strengthen the edge‐based semidefinite programming relaxation...
Online scheduling of bounded length jobs to maximize throughput
Online scheduling of bounded length jobs to maximize throughput
2012,
We consider an online scheduling problem, motivated by the issues present at the...
Reliability of task graph schedules with transient and fail‐stop failures: complexity and algorithms
Reliability of task graph schedules with transient and fail‐stop failures: complexity and algorithms
2012,
This paper deals with the reliability of task graph schedules with transient and...
Adaptive large neighborhood search for service technician routing and scheduling problems
Adaptive large neighborhood search for service technician routing and scheduling problems
2012,
Motivated by the problem situation faced by infrastructure service and maintenance...
Scheduling flexible maintenance activities subject to job‐dependent machine deterioration
Scheduling flexible maintenance activities subject to job‐dependent machine deterioration
2012,
This paper considers single machine scheduling that integrates machine deterioration....
Unbounded parallel‐batching scheduling with two competitive agents
Unbounded parallel‐batching scheduling with two competitive agents
2012,
We consider the scheduling problems arising when two agents, each with a family of...
Multi‐objective scheduling and a resource allocation problem in hospitals
Multi‐objective scheduling and a resource allocation problem in hospitals
2012,
This study addresses the issue of scheduling medical treatments for resident patients...
A simple randomized algorithm for two‐dimensional strip packing
A simple randomized algorithm for two‐dimensional strip packing
2013,
Two‐dimensional strip packing problem is to pack given rectangular pieces on a...
Solving software project scheduling problems with ant colony optimization
Solving software project scheduling problems with ant colony optimization
2013,
Software project scheduling problem (SPSP) is one of the important and challenging...
A two‐phase hybrid heuristic algorithm for the capacitated location‐routing problem
A two‐phase hybrid heuristic algorithm for the capacitated location‐routing problem
2013,
In this paper, we propose a two‐phase hybrid heuristic algorithm to solve the...
A decomposition approach for the car resequencing problem with selectivity banks
A decomposition approach for the car resequencing problem with selectivity banks
2013,
An important decision problem when mass‐producing customized product to order...
Insertion based Lin–Kernighan heuristic for single row facility layout
Insertion based Lin–Kernighan heuristic for single row facility layout
2013,
The single row facility layout problem (SRFLP) is the problem of arranging facilities...
Online interval scheduling on a single machine with finite lookahead
Online interval scheduling on a single machine with finite lookahead
2013,
We study an online weighted interval scheduling problem on a single machine, where all...
An efficient hybrid meta‐heuristic for aircraft landing problem
An efficient hybrid meta‐heuristic for aircraft landing problem
2013,
Aircraft landing problem is to assign an airport's runways to the arrival aircrafts as...
Scheduling problems with two competing agents to minimized weighted earliness–tardiness
Scheduling problems with two competing agents to minimized weighted earliness–tardiness
2013,
We study scheduling problems with two competing agents , sharing the same machines....
A robust optimisation model and cutting planes for the planning of energy‐efficient wireless networks
A robust optimisation model and cutting planes for the planning of energy‐efficient wireless networks
2013,
In this paper, we present an optimisation model for the energy‐efficient...
A theoretical development for the total tardiness problem and its application in branch and bound algorithms
A theoretical development for the total tardiness problem and its application in branch and bound algorithms
2013,
This paper deals with the single machine total tardiness problem, and proves that if...
A single machine carryover sequence‐dependent group scheduling in PCB manufacturing
A single machine carryover sequence‐dependent group scheduling in PCB manufacturing
2013,
This paper considers the problem of minimizing the makespan on a single machine with...
Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
2013,
In a previous work, a min–max–min model has been proposed for robust...
Papers per page: