Journal: Computers and Operations Research

Found 2748 papers in total
A new constraint programming approach for the orthogonal packing problem
A new constraint programming approach for the orthogonal packing problem
2008,
The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set...
Reactive GRASP for the strip-packing problem
Reactive GRASP for the strip-packing problem
2008,
This paper presents a greedy randomized adaptive search procedure (GRASP) for the...
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
2008,
A heuristic recursive algorithm for the two-dimensional rectangular strip packing...
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
2008,
Many heuristic approaches have been proposed in the literature for the multiple length...
Applying evolutionary computation to the school timetabling problem: The Greek case
Applying evolutionary computation to the school timetabling problem: The Greek case
2008,
In this contribution, an adaptive algorithm based on evolutionary computation...
Locating a low-level waste disposal site
Locating a low-level waste disposal site
2008,
A model is developed to locate a waste disposal site for low-level (domestic and...
A multiperiod set covering location model for dynamic redeployment of ambulances
A multiperiod set covering location model for dynamic redeployment of ambulances
2008,
Emergency medical service (EMS) providers continually seek ways to improve system...
Lot sizing and furnace scheduling in small foundries
Lot sizing and furnace scheduling in small foundries
2008,
A lot sizing and scheduling problem prevalent in small market-driven foundries is...
Locating a low-level waste disposal site
Locating a low-level waste disposal site
2008,
A model is developed to locate a waste disposal site for low-level (domestic and...
Solving the swath segment selection problem through Lagrangean relaxation
Solving the swath segment selection problem through Lagrangean relaxation
2008,
The swath segment selection problem (SSSP) is an NP -hard combinatorial optimization...
Adaptive memory programming for the robust capacitated international sourcing problem
Adaptive memory programming for the robust capacitated international sourcing problem
2008,
The International Sourcing Problem consists of selecting a subset from an available...
A loss function approach to group preference aggregation in the AHP
A loss function approach to group preference aggregation in the AHP
2008,
The Analytic Hierarchy Process is a useful method in aggregating group preference....
A new modeling and solution approach for the set-partitioning problem
A new modeling and solution approach for the set-partitioning problem
2008,
The set-partitioning problem (SPP) is widely known for both its application potential...
Ant colony optimization for the traveling purchaser problem
Ant colony optimization for the traveling purchaser problem
2008,
The traveling purchaser problem (TPP) is a generalization of the traveling salesman...
Modeling and solving the rooted distance-constrained minimum spanning tree problem
Modeling and solving the rooted distance-constrained minimum spanning tree problem
2008,
In this paper we discuss models and methods for solving the rooted distance...
Good triangulations yield good tour
Good triangulations yield good tour
2008,
Consider the following heuristic for planar Euclidean instances of the traveling...
Circulation of railway rolling stock: a branch-and-price approach
Circulation of railway rolling stock: a branch-and-price approach
2008,
In this paper, we describe a model and a branch-and-price algorithm to determine an...
Max–min fairness in multi-commodity flows
Max–min fairness in multi-commodity flows
2008,
In this paper, we provide a study of Max–Min Fair (MMF) multi-commodity flows...
Roll assortment optimization in a paper mill: An integer programming approach
Roll assortment optimization in a paper mill: An integer programming approach
2008,
Fine paper mills produce a variety of paper grades to satisfy demand for a large...
Selecting compact habitat reserves for species with differential habitat size needs
Selecting compact habitat reserves for species with differential habitat size needs
2008,
We propose a model for the design of protected habitat reserves, which maximizes the...
Optimal reserve site selection with distance requirements
Optimal reserve site selection with distance requirements
2008,
The reserve set covering problem minimizes the total cost or area of sites needed to...
Computational experiments with heuristics for two nature reserve site selection problems
Computational experiments with heuristics for two nature reserve site selection problems
2008,
Nature reserve site selection has become critical as the human population grows and...
Polynomial time algorithms for the unit execution time permutation flowshop problem with time delays
Polynomial time algorithms for the unit execution time permutation flowshop problem with time delays
2008,
This paper addresses the problem of scheduling a set of n unit execution time jobs on...
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
2008,
In this paper, metaheuristic approaches for the two-machine flow-shop problem with a...
Papers per page: