Journal: Computers and Operations Research

Found 2748 papers in total
Multiple objective branch and bound for mixed 0‐1 linear programming: Corrections and improvements for the biobjective case
Multiple objective branch and bound for mixed 0‐1 linear programming: Corrections and improvements for the biobjective case
2013,
This work addresses the correction and improvement of Mavrotas and Diakoulaki's branch...
Hybrid column generation and large neighborhood search for the dial‐a‐ride problem
Hybrid column generation and large neighborhood search for the dial‐a‐ride problem
2013,
Demographic change towards an ever aging population entails an increasing demand for...
Greedy algorithms for a class of knapsack problems with binary weights
Greedy algorithms for a class of knapsack problems with binary weights
2012,
In this article we identify a class of two‐dimensional knapsack problems with...
A discrete time exact solution approach for a complex hybrid flow‐shop scheduling problem with limited‐wait constraints
A discrete time exact solution approach for a complex hybrid flow‐shop scheduling problem with limited‐wait constraints
2012,
We study a real‐world complex hybrid flow‐shop scheduling problem...
An improved algorithm for the longest common subsequence problem
An improved algorithm for the longest common subsequence problem
2012,
The Longest Common Subsequence problem seeks a longest subsequence of every member of...
Risk‐averse two‐stage stochastic programming with an application to disaster management
Risk‐averse two‐stage stochastic programming with an application to disaster management
2012,
Traditional two‐stage stochastic programming is risk‐neutral; that is,...
Inequality constraint handling in genetic algorithms using a boundary simulation method
Inequality constraint handling in genetic algorithms using a boundary simulation method
2012,
Constraint handling is one of the major concerns when applying genetic algorithms...
Cliques with maximum/minimum edge neighborhood and neighborhood density
Cliques with maximum/minimum edge neighborhood and neighborhood density
2012,
This paper addresses maximum/minimum edge neighborhood and neighborhood density...
Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction
Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction
2012,
The capacitated clustering problem (CCP) has been studied in a wide range of...
Single‐machine makespan minimization scheduling with nonlinear shortening processing times
Single‐machine makespan minimization scheduling with nonlinear shortening processing times
2012,
In this paper, we consider the single‐machine makespan minimization scheduling...
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
2012,
The cumulative capacitated vehicle routing problem (CCVRP) is a variation of the...
Interior point methods in DEA to determine non‐zero multiplier weights
Interior point methods in DEA to determine non‐zero multiplier weights
2012,
This is a study on the generation of non‐zero weights in DEA using interior...
Performance evaluation of a synchronization station with multiple inputs and population constraints
Performance evaluation of a synchronization station with multiple inputs and population constraints
2012,
Synchronization stations are commonly used to model kitting operations in...
Simulated annealing for optimal ship routing
Simulated annealing for optimal ship routing
2012,
In this article we present a simulated annealing based algorithm for the determination...
Makespan minimization on single batch‐processing machine via ant colony optimization
Makespan minimization on single batch‐processing machine via ant colony optimization
2012,
This paper investigates the problem of minimizing makespan on a single...
Batch scheduling on uniform machines to minimize total flow‐time
Batch scheduling on uniform machines to minimize total flow‐time
2012,
The solution of the classical batch scheduling problem with identical jobs and setup...
Lagrangean relaxation heuristics for the p‐cable‐trench problem
Lagrangean relaxation heuristics for the p‐cable‐trench problem
2012,
We address the p ‐cable‐trench problem. In this problem, p facilities...
The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics
The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics
2012,
This work is devoted to the Dynamic Space Allocation Problem, where project duration...
Shift‐and‐merge technique for the DP solution of the time‐constrained backpacker problem
Shift‐and‐merge technique for the DP solution of the time‐constrained backpacker problem
2012,
We formulate the time‐constrained backpacker problem as an extension of the...
A Lagrangian approach for minimum cost single round robin tournaments
A Lagrangian approach for minimum cost single round robin tournaments
2012,
Single round robin tournaments are a well known class of sports leagues schedules. We...
An LP‐based heuristic algorithm for the node capacitated in‐tree packing problem
An LP‐based heuristic algorithm for the node capacitated in‐tree packing problem
2012,
We conducted computational experiments on graphs used in related papers and on...
Two‐stage hybrid flow shop with precedence constraints and parallel machines at second stage
Two‐stage hybrid flow shop with precedence constraints and parallel machines at second stage
2012,
This study deals with the two‐stage hybrid flow shop (HFS) problem with...
Branch‐and‐bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
Branch‐and‐bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
2012,
In this paper, we consider a single‐machine scheduling problem with release...
Extended local search algorithm based on nonlinear programming for two‐dimensional irregular strip packing problem
Extended local search algorithm based on nonlinear programming for two‐dimensional irregular strip packing problem
2012,
This paper presents an extended local search algorithm (ELS) for the irregular strip...
Papers per page: