Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Country: Netherlands
Found
18376 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Advances in design and implementation of optimization software
2002,
Maros Istvn
Developing optimization software that is capable of solving large and complex...
ENCON: An evolutionary algorithm for the antenna placement problem
2003,
Zimmermann Jrg
The placement of antennas is an important step in the design of mobile radio networks....
Approximately global optimization for assortment problems using piecewise linearization techniques
2002,
Li Han-Lin
Recently, Li and Chang proposed an approximate model for assortment problems. Although...
Fuzzy simulated evolution algorithm for very large scale integrated cell placement
2003,
Sait Sadiq M.
Placement is a major step encountered during the design of very large scale integrated...
A simulation and design of experiments modeling approach to minimize building maintenance costs
2002,
Dessouky Yasser M.
In this paper, a methodology is presented to integrate maintenance policy selection...
Preservation of association in multivariate shock and claim models
2002,
Shaked Moshe
Consider m counting processes Γ i , i=1,2,...,m, and a random vector of positive...
Extended block replacement policy with shock models and used items
2002,
Sheu Shey-Huei
This paper considers an extended block replacement policy with shock models and used...
Approximation algorithms for fractional knapsack problems
2002,
Billionnet Alain
We consider the combinatorial optimization problem where the objective function is the...
Linear relaxations and reduced-cost based propagation of continuous variable subscripts
2002,
Thorsteinsson Erlendur S.
In hybrid solvers for combinatorial optimisation, combining Constraint (Logic)...
Cost based filtering for the constrained knapsack problem
2002,
Fahle Torsten
We present cost based filtering methods for Knapsack Problems (KPs). Cost based...
Convex normalizations in lift-and-project methods for 0–1 programming
2002,
Rey Pablo A.
Branch-and-Cut algorithms for general 0–1 mixed integer programs can be...
Customer's time-variant purchase behavior and corresponding marketing strategies: An online retailer's case
2002,
Park Sang Chan
The traditional customer relationship management (CRM) studies are mainly focused on...
Multiple setup printed circuit board assembly planning using genetic algorithms
2002,
Knapp Gerald M.
A Genetic Algorithm (GA) program is developed for simultaneously optimizing component...
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
2002,
Hochbaum Dorit S.
We define a class of monotone integer programs with constraints that involve up to...
A note on the maximization version of the multi-level facility location problem
2002,
Ye Yinyu
We show that the maximization version of the multi-level facility location problem can...
A tabu scatter search metaheuristic for the arc routing problem
2003,
Greistorfer Peter
We consider a special routing problem which has a variety of practical applications....
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
2002,
Minoux M.
We present an exact separation scheme for identifying most violated extended cover...
Solving the knapsack problem via ℤ-transform
2002,
Lasserre Jean B.
Given vectors a,c∈ℤ n and b ∈ℤ, we consider the (unbounded)...
A nonlinear Lagrangian dual for integer programming
2002,
Li Duan
Nonlinear Lagrangian theory offers a success guarantee for the dual search via...
Crew assignment via constraint programming: Integrating column generation and heuristic tree search
2002,
Fahle Torsten
The Airline Crew Assignment Problem (ACA) consists of assigning lines of work to a set...
A network model for airline cabin crew scheduling
2002,
Yan Shangyao
Airline crew scheduling problems have been traditionally formulated as set covering...
Pivot versus interior point methods: Pros and cons
2002,
Terlaky Tams
Linear optimization (LO) is the fundamental problem of mathematical optimization. It...
Redefining event variables for efficient modeling of continuous-time batch processing
2002,
Guignard Monique
We define events so as to reduce the number of events and decision variables needed...
An extension of the fundamental theorem of linear programming
2002,
Brown A.
In 1947 George Dantzig developed the Simplex Algorithm for linear programming, and in...
First Page
300
301
302
303
304
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers