Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Operations Research
Found
2096 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Octane: A new heuristic for pure 0–1 programs
2001,
Balas Egon
We propose a new heuristic for pure 0–1 programs, which finds feasible integer...
A lower bound for the split delivery vehicle routing problem
2000,
Mota E.
In this paper we consider the Split Delivery Vehicle Routing Problem (SDVRP), a...
Computing moments of the exit time distribution for Markov processes by linear programming
2001,
Helmes Kurt
We provide a new approach to the numerical computation of moments of the exit time...
Stigler's diet problem revisited
2001,
Gass Saul I.
We review Stigler's diet problem, its impact on linear programming and operations...
Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem
2000,
Vanderbeck Franois
The cutting stock problem is that of finding a cutting of stock material to meet...
The national energy modeling system: A large-scale energy-economic equilibrium model
2001,
Gabriel Steven A.
The National Energy Modeling System (NEMS) is a large-scale mathematical model that...
Heuristics for balancing turbine fans
2000,
Bartholdi John J.
We develop heuristics for a problem that models the static balancing of turbine fans:...
Optimal design of truss structures by logic-based branch and cut
2001,
Hooker J.N.
The truss design problem is to find the optimal placement and size of structural bars...
An integer optimization approach to a probabilistic reserve site selection problem
2000,
Revelle Charles S.
Interest in protecting natural areas is increasing as development pressures and...
Dynamic allocation of kidneys to candidates on the transplant waiting list
2000,
Wein Lawrence M.
The crux of the kidney allocation problem is the trade-off between clinical efficiency...
Improving repetitive manufacturing systems: Model and insights
2001,
Webster Scott
We consider a manufacturing system that is controlled by a fixed-cycle smoothed...
Two dimensional rendezvous search
2001,
Anderson Edward J.
We consider rendezvous problems in which two players move on the plane and wish to...
Scheduling a major college basketball conference – revisited
2001,
Henz Martin
Nemhauser and Trick presented the problem of finding a timetable for the 1997/1998...
Free-flight and en route air safety: A first-order analysis
2000,
Barnett Arnold
Under present arrangements, US commercial planes do not travel ‘as the crow...
Reducing labor costs in a load–transfer–load crossdocking terminal
2000,
Bartholdi John J.
Handling freight in a crossdocking terminal is labor intensive and therefore costly...
Safe at home? An experiment in domestic airline security
2001,
Barnett Arnold
The paper describes a scientific experiment about a contentious policy issue: What...
Railroad blocking: A network design application
2000,
Barnhart Cynthia
In this study, we formulate the railroad blocking problems as a network design problem...
Measurement-based usage charges in communications networks
2000,
Courcoubetis Costas
We study usage-sensitive charging schemes for broadband communications networks. We...
Topological design of two-level telecommunication networks with modular switches
2000,
Marcotte Odile
In this article we propose a mixed 0–1 linear programming model for the...
Solving the two-connected network with bounded meshes problem
2000,
Labb Martine
We study the problem of designing at minimum cost a two-connected network such that...
The impact of cell dropping policies in asynchronous transfer mode nodes
2001,
Righter Rhonda
We consider policies for deciding which cells will be lost or dropped when losses...
The analytic hierarchy process – an exposition
2001,
Gass Saul I.
This exposition on the Analytic Hierarchy Process (AHP) has the following objectives:...
Time-cost trade-offs in overlapped product development
2000,
Ahmadi Reza
Increasingly shorter product life cycles impel firms to design, develop, and market...
The uncapacitated facility location problem with client matching
2000,
Laporte Gilbert
The Uncapacitated Facility Location Problem with Client Matching (LCM) is an extension...
First Page
41
42
43
44
45
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers