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
Minimax and symmetric duality for a class of multiobjective variational mixed integer programming problems
2004,
Chen Xiuhong
In this paper, we formulate a pair of multiobjective variational mixed integer...
Optimization with additional variables and constraints
2005,
Jttner Alpr
Norton, Plotkin and Tardos proved that, loosely spoken, an LP problem is solvable in...
On complexity of unconstrained hyperbolic 0–1 programming problems
2005,
Pardalos Panos M.
Single- and multiple-ratio unconstrained hyperbolic 0–1 programming problems are...
Average performance of greedy heuristics for the integer knapsack problem
2004,
Kohli Rajeev
This paper derives a lower bound on the average performance of a total-value greedy...
Meta-RaPS approach for the 0–1 multidimensional knapsack problem
2005,
Whitehouse Gary E.
A promising solution approach called Meta-RaPS is presented for the 0–1...
A mathematical approach for the formation of manufacturing cells
2005,
Chen Mingyuan
One of the major steps in designing cellular manufacturing systems is to form cells....
The computation of the worst conditional expectation
2004,
Benati Stefano
Recent advances in risk theory identify risk as a measure related to the tail of a...
A note on the assignment problem with seniority and job priority constraints
2004,
Volgenant A.
Consider an assignment problem in which persons are qualified for a subset of the...
A hybrid algorithm for identifying global and local minima when optimizing functions with many minima
2004,
Salhi S.
The problem of determining most global minima including some of the local ones for...
Inverse conic programming with applications
2005,
Iyengar Garud
Linear programming duality yields efficient algorithms for solving inverse linear...
The multidimensional 0–1 knapsack problem: An overview
2004,
Frville Arnaud
The multidimensional 0–1 knapsack problem is one of the most well-known...
Global optimization and multi knapsack: A percolation algorithm
2004,
Fortin Dominique
Since the standard multi knapsack problem may be rewritten as a reverse convex...
An approach to generate rules from neural networks for regression problems
2004,
Setiono Rudy
Artifical neural networks have been successfully applied to a variety of business...
Evaluating Kohonen's learning rule: An approach through genetic algorithms
2004,
Curry B.
This paper examines the technical foundations of the self-organising map (SOM). It...
The complexity of minimum ratio spanning tree problems
2004,
Palocsay Susan W.
We examine the complexity of two minimum spanning tree problems with rational...
The tree longest detour problem in a biconnected graph
2004,
Wang Yue-Li
In a biconnected graph, a detour is the best alternative path from a detour-starting...
Inapproximability and a polynomially solvable special case of a network improvement problem
2004,
Yang X.G.
We consider a network improvement problem in which we wish to spend as little as...
Decisions rules and flow networks
2004,
Pawlak Zdzisaw
This paper, which is a continuation of a series of the author's papers on the...
On the core of the multicommodity flow game
2005,
Markakis Evangelos
In the work of Papadimitriou, he proposed a game theoretic framework for analyzing...
Sequential process control under capacity constraints
2004,
Shanthikumar J. George
We consider a sequential process control model under inspection capacity constraints....
Markovian start-up demonstration tests with rejection of units upon observing d failures
2004,
Martin Donald E.K.
By conditioning on the time of the first failure, several results are derived for...
Approximately-strategyproof and tractable multiunit auctions
2005,
Suri Subhash
We present an approximately-efficient and approximately-strategyproof auction...
Stabex method for extension of α-polynomial hereditary classes
2004,
Zverovich Igor .
A class of graphs is called α-polynomial if there exists a polynomial-time...
Solving group Steiner problems as Steiner problems
2004,
Volgenant A.
The generalized spanning tree or group Steiner problem (GSP) is a generalization of...
First Page
199
200
201
202
203
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers