Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: programming: integer
Found
3058 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Dry-or-buy decision support for dry kiln scheduling in furniture production
2001,
Hodgson Thom J.
In this paper, a dry-or-buy cost model for a dry kiln scheduling problem in the...
An integer programming model for the weekly tour scheduling problem
2001,
Luss Hanan
We study a workforce planning and scheduling problem in which weekly tours of agents...
Solving personnel tour scheduling problems using the dual all-integer cutting plane
1998,
Brusco M.J.
Personnel tour scheduling problems are highly relevant to service organizations and...
A branch and cut algorithm for the VRP with satellite facilities
1998,
Bard J.F.
An important aspect of the vehicle routing problem (VRP) that has been largely...
Pig production in Goias state: Using a spatial model
2000,
Lopes R.L.
The main propose of this research work was to analyze the most efficient spatial...
A dual-ascent procedure for the file allocation and join site selection problem on a telecommunications network
1999,
Murthy Ishwar
In this paper, a model and a solution procedure is developed for the File Allocation...
Facet-defining inequalities for the cutting stock problem
1999,
Scheithauer G.
In this paper the polyhedron of the cutting stock problem is investigated with respect...
Master scheduling and tracking aircraft upgrades
1999,
Kelley David L.
This decision support tool automates what traditionally has been an unwieldy, time...
Multistage lot sizing problems via randomized rounding
2001,
Bertsimas Dimitris
We study the classical multistage lot sizing problem that arises in distribution and...
A heuristic for production scheduling and inventory control in the presence of sequence-dependent setup times
1999,
Laguna Manuel
The consideration of sequence-dependent setup times is one of the most difficult...
Planning and coordination of production and distribution facilities for multiple commodities
2001,
Pirkul Hasan
We study an integrated logistics model for locating production and distribution...
A fast algorithm for assortment optimization problems
2001,
Li Han-Lin
Assortment optimization problems intend to seek the best way of placing a given set of...
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...
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...
Genetic algorithm approach to generating the optimal development of a thin-walled object
2001,
Masaya Toyama
The authors present a new method for generating the optimal development of a...
An integer programming approach to the time slot assignment problem in satellite switched time-division multiple-access systems with intersatellite links
2001,
Park Sungsoo
We consider the time slot assignment problem (TSAP) in a cluster of satellite-switched...
Optimized crew scheduling at Air New Zealand
2001,
Wallace Chris A.
The aircrew-scheduling problem consists of two important subproblems: the...
A mean-variance model for route guidance in advanced traveler information systems
2001,
Rathi Ajay K.
Traditional models of route generation are based on choosing routes that minimize...
Sorting permutations by reversals through branch-and-price
2001,
Caprara Alberto
We describe an exact algorithm for the problem of sorting a permutation by the minimum...
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
2001,
Gouveia Lus
We present a new Lagrangean relaxation for the hop-constrained minimum spanning tree...
Models for a Steiner ring network design problem with revenues
2001,
Gouveia Lus
Consider a graph G = ( V,E ), where the set of nodes V is partitioned into two sets,...
On generalized minimum spanning trees
2001,
Laporte Gilbert
The generalized minimum spanning tree problem consists of designing a minimum cost...
Heuristics for the multi-resource generalized assignment problem
2001,
Mazzola Joseph B.
The well-known generalized assignment problem (GAP) involves the identification of a...
First Page
80
81
82
83
84
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers