Journal: Computers and Operations Research

Found 2748 papers in total
A particular approach for the Three‐dimensional Packing Problem with additional constraints
A particular approach for the Three‐dimensional Packing Problem with additional constraints
2010,
We present an alternative non‐linear formulation for the 3D‐BPP version...
Black box scatter search for general classes of binary optimization problems
Black box scatter search for general classes of binary optimization problems
2010,
The purpose of this paper is to apply the scatter search methodology to general...
The multi‐shift vehicle routing problem with overtime
The multi‐shift vehicle routing problem with overtime
2010,
In this paper, we study a new variant of the vehicle routing problem (VRP) with time...
Multi‐dimensional bin packing problems with guillotine constraints
Multi‐dimensional bin packing problems with guillotine constraints
2010,
The problem addressed in this paper is the decision problem of determining if a set of...
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...
Scenario construction and reduction applied to stochastic power generation expansion planning
Scenario construction and reduction applied to stochastic power generation expansion planning
2013,
A challenging aspect of applying stochastic programming in a dynamic setting is to...
An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks
An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks
2013,
We present a metaheuristic approach which combines constructive heuristics and local...
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...
Variable neighborhood search for location routing
Variable neighborhood search for location routing
2013,
In this paper we propose various neighborhood search heuristics (VNS) for solving the...
High density packings of equal circles in rectangles with variable aspect ratio
High density packings of equal circles in rectangles with variable aspect ratio
2013,
Arranging a fixed number n of equal non‐overlapping circles in a rectangle with...
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...
Weighted tardiness for the single machine scheduling problem:An examination of precedence theorem productivity
Weighted tardiness for the single machine scheduling problem:An examination of precedence theorem productivity
2013,
Earlier research by Kanet has provided a number of new theorems for deciding...
Memetic search for the max‐bisection problem
Memetic search for the max‐bisection problem
2013,
Given an undirected graph G = ( V , E ) with weights on the edges, the...
Supervised classification and mathematical optimization
Supervised classification and mathematical optimization
2013,
Data mining techniques often ask for the resolution of optimization problems....
Branch and bound for the cutwidth minimization problem
Branch and bound for the cutwidth minimization problem
2013,
The cutwidth minimization problem consists of finding a linear arrangement of the...
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...
Breakout Local Search for maximum clique problems
Breakout Local Search for maximum clique problems
2013,
The maximum clique problem (MCP) is one of the most popular combinatorial optimization...
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...
A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
2013,
In recent years, a large number of heuristics have been proposed for the minimization...
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...
Papers per page: