Journal: Computers and Operations Research

Found 2748 papers in total
A two‐stage bid‐price control for make‐to‐order revenue management
A two‐stage bid‐price control for make‐to‐order revenue management
2012,
Capacity control implementations in make‐to‐order (MTO) revenue...
Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
2012,
We address the problem of maximizing the lifetime of a wireless sensor network with...
Fast bounding procedures for large instances of the Simple Plant Location Problem
Fast bounding procedures for large instances of the Simple Plant Location Problem
2012,
Some new, simple and extremely fast bounding procedures are presented for...
Simultaneous re‐design and scheduling of multiple effect evaporator systems
Simultaneous re‐design and scheduling of multiple effect evaporator systems
2012,
Evaporation is a key operation in many industries and its optimization is required for...
Recursive operation time maximization model for the maintenance of power generation equipment
Recursive operation time maximization model for the maintenance of power generation equipment
2012,
Repairable equipment requires preventive maintenance (PM) to maintain proper function....
A PROMETHEE‐based approach to portfolio selection problems
A PROMETHEE‐based approach to portfolio selection problems
2012,
In this paper, we study the use of PROMETHEE outranking methods for portfolio...
An efficient local search for minimizing completion time variance in permutation flow shops
An efficient local search for minimizing completion time variance in permutation flow shops
2012,
This paper illustrates that by exploiting the structure of hard combinatorial...
An algorithmic framework for solving large‐scale multistage stochastic mixed 0–1 problems with nonsymmetric scenario trees
An algorithmic framework for solving large‐scale multistage stochastic mixed 0–1 problems with nonsymmetric scenario trees
2012,
In this paper we present a parallelizable Branch‐and‐Fix Coordination...
Integrated efficiency and trade‐off analyses using a DEA‐oriented interactive minimax reference point approach
Integrated efficiency and trade‐off analyses using a DEA‐oriented interactive minimax reference point approach
2012,
A DEA ‐oriented Interactive Minimax Reference Point ( DEA‐IMRP )...
Restricted dynamic programming: A flexible framework for solving realistic VRPs
Restricted dynamic programming: A flexible framework for solving realistic VRPs
2012,
Most successful solution methods for solving large vehicle routing and scheduling...
Variable neighbourhood search for the variable sized bin packing problem
Variable neighbourhood search for the variable sized bin packing problem
2012,
The variable sized bin packing problem is a generalisation of the...
Measuring instance difficulty for combinatorial optimization problems
Measuring instance difficulty for combinatorial optimization problems
2012,
Discovering the conditions under which an optimization algorithm or search heuristic...
An effective shuffled frog‐leaping algorithm for resource‐constrained project scheduling problem
An effective shuffled frog‐leaping algorithm for resource‐constrained project scheduling problem
2012,
In this paper, we propose an effective heuristic based on the framework of the...
Online algorithms for the multiple time series search problem
Online algorithms for the multiple time series search problem
2012,
This work investigates the online multiple time series search problem. Given a storage...
A study on bunker fuel management for the shipping liner services
A study on bunker fuel management for the shipping liner services
2012,
In this paper, we consider a bunker fuel management strategy study for a single...
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
2012,
This paper studies the Traveling Salesman Problem with Pickups, Deliveries, and...
An effective genetic algorithm for network coding
An effective genetic algorithm for network coding
2012,
The network coding problem (NCP), which aims to minimize network coding resources such...
Solving shortest path problems with a weight constraint and replenishment arcs
Solving shortest path problems with a weight constraint and replenishment arcs
2012,
This paper tackles a generalization of the weight constrained shortest path problem...
Minimizing the weighted sum of squared tardiness on a single machine
Minimizing the weighted sum of squared tardiness on a single machine
2012,
This paper considers a problem in which there is a set of jobs to be sequenced on a...
An operator allocation optimization model for balancing control of the hybrid assembly lines using Pareto utility discrete differential evolution algorithm
An operator allocation optimization model for balancing control of the hybrid assembly lines using Pareto utility discrete differential evolution algorithm
2012,
This paper investigates the operator allocation problems (OAP) with jobs sharing and...
The single‐machine total weighted tardiness scheduling problem with position‐based learning effects
The single‐machine total weighted tardiness scheduling problem with position‐based learning effects
2012,
This study addresses the problem of minimizing the total weighted tardiness on a...
Heuristic solutions to the long‐term unit commitment problem with cogeneration plants
Heuristic solutions to the long‐term unit commitment problem with cogeneration plants
2012,
We consider a long‐term version of the unit commitment problem that spans over...
Coloring large graphs based on independent set extraction
Coloring large graphs based on independent set extraction
2012,
This paper presents an effective approach (EXTRACOL) to coloring large graphs. The...
Lower tolerance‐based Branch and Bound algorithms for the ATSP
Lower tolerance‐based Branch and Bound algorithms for the ATSP
2012,
In this paper, we develop a new tolerance‐based Branch and Bound algorithm for...
Papers per page: