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
Optimizing forest stand management with natural regeneration and single-tree choice variables
2000,
Hof John
This article addresses the any-aged forest management problem with individual trees as...
Comparing adjacency constraint formulations for randomly generated forest planning problems with four age-class distributions
2000,
McDill Marc E.
Three types of adjacency constraint formulations – pairwise, Type I ND...
An optimization problem arising in the design of multiring systems
2000,
Arbib Claudio
We address a design problem that arises when a circular architecture is adopted to...
An algorithm for the multiparametric 0–1-integer linear programming problem relative to the objective function
2000,
Crema Alejandro
The multiparametric 0–1-Integer Linear Programming (0–1-ILP) problem...
A linearization method for mixed 0–1 polynomial programs
2000,
Chang Ching-Ter
This paper proposes a concise method for solving mixed 0–1 polynomial...
An extended scheduling model for producing corrugated boxes
2000,
Bolat Ahmed
Today, custom and shipping regulations recognize the importance of lightweight and...
A hybrid genetic/optimization algorithm for a task allocation problem
1999,
Bean James C.
We consider the problem of designing a distributed computing system for handling a set...
An exact method for the vehicle routing problem with backhauls
1999,
Mingozzi Aristide
We consider the problem in which a fleet of vehicles located at a central depot is to...
Using mixed-integer programming to reduce label changes in the Coors aluminum can plant
2000,
Katok Elena
Valley Metal Container (VMC), a joint venture between the Coors Brewing Company and...
Optimizing cane supply decisions within a sugar mill region
1999,
Higgins A.J.
A sugar mill region contains large differences in sugar yield due to harvest date,...
Branch-and-price algorithms for the one-dimensional cutting stock problem
1998,
Vance P.H.
We compare two branch-and-price approaches for the cutting stock problem. Each...
A tree-search method for solving a cutting stock assignment problem
2000,
Smith N.R.
Many production environments such as carpet or flat glass manufacturing have linked...
The US Army National Guard's mobile training simulators location and routing problem
1999,
Murty Katta G.
For training National Guard units, the U.S. Army National Guard will field 21 combat...
Tactical and strategic models for satellite customer assignment
2000,
Rolland E.
In this paper we develop tactical and strategic models for assignments of customers to...
On the airline schedule perturbation problem caused by the ground delay program
1997,
Yu G.
The ground delay program is one of several programs that the Federal Aviation...
The preferential bidding system at Air Canada
1998,
Soumis Franois
This paper describes the Preferential Bidding Problem solved in the airline industry...
The multiple connections multi-airport ground holding problem: Models and algorithms
1998,
Romanin-Jacur Giorgio
In recent years air traffic has dramatically increased without a corresponding...
Scheduling of time-shared jet aircraft
1998,
Keskinocak P.
Motivated by a real application, we consider the following aircraft scheduling...
An optimal routing algorithm for a transfer crane in port container terminals
1999,
Kim Kap Hwan
This paper focuses on how to optimally route transfer cranes in a container yard...
Improved empty freight car distribution
1998,
Holmberg K.
In this paper we consider the problem of distributing empty freight cars in a railway...
Constructing railroad blocking plans to minimize handling costs
1998,
Barnhart Cynthia
On major domestic railroads, a typical general merchandise shipment may pass through...
Railway timetabling using Lagrangian relaxation
1998,
Lindberg P.O.
We present a novel optimization approach for the timetabling problem of a railway...
Dynamic control of logistics queueing networks for large-scale fleet management
1998,
Powell Warren B.
Dynamic fleet management problems are normally formulated as networks over dynamic...
New trends in exact algorithms for the 0–1 knapsack problem
2000,
Martello Silvano
While the 1980s were focused on the solution of large sized ‘easy’...
First Page
87
88
89
90
91
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers