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 heuristic for the Steiner problem in graphs
1996,
Pardalos Panos M.
In this paper, we present a heuristic for the Steiner problem in graphs along with...
A complementarity approach to a quasistatic multi-rigid-body contact problem
1996,
Pang Jong-Shi
In this paper, we study the problem of predicting the quasistatic planar motion of a...
Optimal and approximate bottleneck Steiner trees
1996,
Salowe Jeffrey S.
Given a set of terminals in the plane, a bottleneck Steiner tree is a tree...
The effects of decision support and task contingencies on model formulation: A cognitive perspective
1996,
Benbasat Izak
This paper takes a cognitive cost–benefit approach to understanding model...
A combinatorial column generation algorithm for the maximum stable set problem
1997,
Laporte Gilbert
In this paper, we derive lower bounds on the size of a minimum cover of a graph G by...
The strategic value of flexibility in sequential decision making
1995,
Talavage Joseph J.
This paper formalizes the notion of flexibility in sequential decision making and...
An interactive-graphic environment for automatic generation of decision trees
1996,
Potvin Jean-Yves
In this paper, a computerized assistant for the construction of decision trees is...
A fuzzy set model for market share and preference prediction
1995,
Turksen I. Burhan
This paper presents a new method of modelling preferences using fuzzy sets. A fuzzy...
A new aggregation–disaggregation algorithm
1995,
Shioyama Tadayoshi
This paper proposes a new algorithm for solving the Kolmogoroff equations for large...
The impact and benefits of a DSS: The case of FleetManager
1996,
Igbaria Magid
A decision support system used for vehicle routing at the Westland Co-operative Dairy...
On linear inequality systems without strongly redundant constraints
1995,
Derks J.J.M.
For an ( m × n )-matrix A the set C ( A ) is studied containing the constraint...
Preference programming through approximate ratio comparisons
1995,
Hmlinen Raimo P.
In the context of hierarchical weighting, this paper operationalizes interval...
The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems
1997,
Paschos Vangelis Th.
We prove that the existence of a polynomial time ρ-approximation algorithm (where...
Proper efficiency and cardinal utilities in multicriteria decision making
1995,
Li Susan X.
The concept of proper efficiency has been characterized in several ways in the...
Annealing algorithms for multisource absolute location problems on graph
1997,
Righini Giovanni
A methodology is presented for applying annealing techniques to multisource absolute...
An information-theoretic 2-stage, 2-decision rule, choice model
1995,
Gensch D.H.
Recent articles in choice modeling advocate two-stage decision processes in which the...
A constrained Steiner tree problem
1995,
Rosenwein M.B.
The Steiner tree problem on a graph involves finding a minimum cost tree which...
A hypergraph framework for optimal model-based decomposition of design problems
1997,
Michelena Nestor F.
Decomposition of large engineering system models is desirable since increased model...
On a new class of Bilevel Programming Problems and its use for reformulating Mixed Integer Problems
1995,
Frangioni Antonio
We extend some known results about the Bilevel Linear Problem (BLP), a hierarchical...
Warehouse–retailer system with stochastic demands–non – identical retailer case
1995,
Chew Ek Peng
We consider a warehouse–retailer system where both the warehouse and the...
A smooth penalty function algorithm for network-structured problems
1995,
Zenios Stavros A.
We discuss the design and implementation of an algorithm for the solution of large...
The hub location and routing problem
1995,
Aykin Turgut
In this paper, we consider the hub location and routing problem in which the hub...
Asynchronous gradient algorithms for a class of convex separable network flow problems
1996,
Baz Didier El
We consider the single commodity strictly convex network flow problem. The dual of...
A parametric maximum flow algorithm for bipartite graphs with applications
1995,
Chen Y.L.
Suppose we are given a capacitated bipartite network G with node sets S and T . In...
First Page
536
537
538
539
540
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers