Journal: Computers and Operations Research

Found 2748 papers in total
Capacity‐constrained multiple‐market price discrimination
Capacity‐constrained multiple‐market price discrimination
2012,
This paper studies a multiple‐market price discrimination problem with...
A heuristic approach for allocation of data to RFID tags: A data allocation knapsack problem (DAKP)
A heuristic approach for allocation of data to RFID tags: A data allocation knapsack problem (DAKP)
2012,
Durable products and their components are increasingly being equipped with one of...
Improved core problem based heuristics for the 0/1 multi‐dimensional knapsack problem
Improved core problem based heuristics for the 0/1 multi‐dimensional knapsack problem
2012,
We consider the 0/1 multi‐dimensional knapsack problem and discuss the...
Solving knapsack problems on GPU
Solving knapsack problems on GPU
2012,
A parallel implementation via CUDA of the dynamic programming method for the knapsack...
A two‐stage stochastic programming model for the parallel machine scheduling problem with machine capacity
A two‐stage stochastic programming model for the parallel machine scheduling problem with machine capacity
2011,
This paper proposes a two‐stage stochastic programming model for the parallel...
Sampled fictitious play for approximate dynamic programming
Sampled fictitious play for approximate dynamic programming
2011,
Sampled fictitious play (SFP) is a recently proposed iterative learning mechanism for...
Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP‐based neighborhood search heuristics
Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP‐based neighborhood search heuristics
2011,
We propose a general‐purpose heuristic approach combining metaheuristics and...
Metaheuristics for the dynamic stochastic dial‐a‐ride problem with expected return transports
Metaheuristics for the dynamic stochastic dial‐a‐ride problem with expected return transports
2011,
The problem of transporting patients or elderly people has been widely studied in...
The capacitated vehicle routing problem with stochastic demands and time windows
The capacitated vehicle routing problem with stochastic demands and time windows
2011,
The capacitated vehicle routing problem with stochastic demands and time windows is an...
A heuristic block coordinate descent approach for controlled tabular adjustment
A heuristic block coordinate descent approach for controlled tabular adjustment
2011,
One of the main concerns of national statistical agencies (NSAs) is to publish tabular...
An efficient column‐generation‐based algorithm for solving a pickup‐and‐delivery problem
An efficient column‐generation‐based algorithm for solving a pickup‐and‐delivery problem
2011,
We introduce a new variation of the pickup‐and‐delivery problem. Current...
Single‐machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
Single‐machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
2011,
In many realistic production situations, a job processed later consumes more time than...
The vendor location problem
The vendor location problem
2011,
The vendor location problem is the problem of locating a given number of vendors and...
Simultaneous coordination of order quantity and reorder point in a two‐stage supply chain
Simultaneous coordination of order quantity and reorder point in a two‐stage supply chain
2011,
In this paper, we investigate the simultaneous coordination of order quantity and...
A dynamic convexized method for nonconvex mixed integer nonlinear programming
A dynamic convexized method for nonconvex mixed integer nonlinear programming
2011,
We consider in this paper the nonconvex mixed‐integer nonlinear programming...
Peer‐estimation for multiple criteria ABC inventory classification
Peer‐estimation for multiple criteria ABC inventory classification
2011,
Inventory classification is an effective way to manage a large number of items. As a...
Complexity of the critical node problem over trees
Complexity of the critical node problem over trees
2011,
In this paper we deal with the critical node problem (CNP), i.e., the problem of...
Linear programming models for traffic engineering in 100% survivable networks under combined IS–IS/OSPF and MPLS‐TE
Linear programming models for traffic engineering in 100% survivable networks under combined IS–IS/OSPF and MPLS‐TE
2011,
This paper concerns the problem of minimizing the maximum link utilization of IP...
Optimal solutions for the balanced minimum evolution problem
Optimal solutions for the balanced minimum evolution problem
2011,
In this paper, we investigate one of the most significant versions of the PEP, called...
Look‐ahead heuristics for the dynamic traveling purchaser problem
Look‐ahead heuristics for the dynamic traveling purchaser problem
2011,
Given a set of products each with positive discrete demand, and a set of markets...
A preference ordered classification for a multi‐objective max–min redundancy allocation problem
A preference ordered classification for a multi‐objective max–min redundancy allocation problem
2011,
In this study, we consider a bi‐objective redundancy allocation problem on a...
Interval scheduling on related machines
Interval scheduling on related machines
2011,
We consider the problem of scheduling n intervals (jobs with fixed starting times) on...
Analysis of the maximum level policy in a production‐distribution system
Analysis of the maximum level policy in a production‐distribution system
2011,
We consider a production‐distribution system, where a facility produces one...
Multi‐operator based evolutionary algorithms for solving constrained optimization problems
Multi‐operator based evolutionary algorithms for solving constrained optimization problems
2011,
Over the last two decades, many sophisticated evolutionary algorithms have been...
Papers per page: