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
A new pivot selection rule for the network simplex algorithm
1997,
Ahuja Ravindra K.
We present a new network simplex pivot selection rule, which we call the minimum ratio...
Optimal design of a generalized conveyor-serviced production station: Fixed and removal item cases
1998,
Feyzbakhsh S.A.
This paper treats an approach to the optimal design of the conveyor system such that...
On strongly polynomial dual simplex algorithms for the maximum flow problem
1997,
Goldfarb Donald
Several pivot rules for the dual network simplex algorithm that enable it to solve a...
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
1997,
Tarjan Robert E.
The dynamic tree> is an abstract data type that allows the maintenance of a...
How to compute least infeasible flows
1997,
McCormick S. Thomas
It is well-known how to use maximum flow to decide when a flow problem with demands,...
Flows on hypergraphs
1997,
Gallo Giorgio
We consider the capacitated minimum cost flow problem on directed hypergraphs. We...
Multiflows and disjoint paths of minimum total cost
1997,
Karzanov Alexander V.
In this paper we discuss a number of recent and earlier results in the field of...
GA based simulation of immune networks applications in structural optimization
1997,
Lee J.
Genetic algorithms have received considerable recent attention in the optimal design...
The role of evolutionary and adaptive search during whole system, constrained and detailed design optimization
1997,
Parmee I.C.
The paper introduces various strategies which incorporate evolutionary and adaptive...
Simulation modelling and analysis of a JIT production system
1998,
Bayko mer Faruk
The JIT production systems have been a focus of interest to researchers. Although...
Evolution strategies in engineering optimization
1997,
Cai Jianbo
The available methods used for the solution of optimization problems in engineering...
Kuratowski convergence of the efficient sets in the parametric linear vector semi-infinite optimization
1996,
Todorov Maxim Ivanov
In the space of whole linear vector semi-infinite optimization problems we consider...
Evolution program for deterministic and stochastic optimizations
1996,
Gen Mitsuo
This paper presents an evolution program for deterministic and stochastic...
Project selection with discounted returns and multiple constraints
1996,
Gupta Sushil K.
This paper considers the problem of selecting a subset of N projects subject to...
A note on ‘Hierarchical models for multi-project planning and scheduling’
1996,
Sprecher Arno
We consider the multi-mode resource-constrained project scheduling problem. The focus...
A heuristic for network project scheduling with random activity durations depending on the resource allocation
1998,
Golenko-Ginzburg Dimitri
This paper presents a heuristic for resource-constrained network project scheduling. A...
Efficiently solvable special cases of hard combinatorial optimization problems
1997,
Burkard Rainer E.
We survey some recent advances in the field of polynomially solvable special cases of...
Reducing performance variation in the canning problem
1996,
Rahim M.A.
Modern quality management practices recommend the elimination of fixed numerical...
Assignment and sequencing models for the scheduling of process systems
1998,
Grossmann Ignacio E.
This paper presents an overview of assignment and sequencing models that are used in...
Two applications of the Divide&Conquer principle in the molecular sciences
1997,
Stoye J.
In this paper, two problems from the molecular sciences are addressed: the enumeration...
An iterative algorithm for scheduling unit-time tasks with precedence constraints to minimise the maximum lateness
1998,
Zinder Yakov
We consider the maximum lateness problem in which all tasks have the same execution...
Semidefinite programming in combinatorial optimization
1997,
Goemans Michel X.
We discuss the use of semidefinite programming for combinatorial optimization...
ACCPM – A library for convex optimization based on an analytic center cutting plane method
1996,
Vial J.-P.
A software review.
Two generalizations of Dykstra's cyclic projections algorithm
1997,
Deutsch Frank
Dykstra's cyclic projections algorithm allows one to compute best approximations to...
First Page
500
501
502
503
504
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers