Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: computational analysis
Found
489 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
2004,
Shabtay Dvir
In this paper we extend the classical single-machine scheduling problem with the...
Evaluating all Bertrand-Nash equilibria in a discrete spatial duopoly model
2004,
Masuda Yasushi
This paper studies a spatial duopoly model where customers are located at nodes and...
A general alternative procedure for solving negative degree of difficulty problems in geometric engineering
2004,
Alejandre J.L.
The degree of difficulty is an important concept in classical geometric programming...
Systemic approach of software management in Internet related applications
2002,
Assimakopoulos N.A.
The problem that often occurs in the Internet environment is not only well known, but...
On-line independent set by coloring vertices
2001,
Paschos Vangelis Th.
In on-line computation, the instance of a problem is revealed step-by-step and one...
A nonmonotone adaptive trust region method and its convergence
2003,
Zhang Xiang-Sun
In this paper, we combine the trust region subproblem with the nonmonotone technique...
Packing random rectangles of given volume
2002,
Rhee Wansoo T.
A packing of a collection of rectangles is a disjoint subcollection. In a recent...
Reducing off-line to on-line: An example and its applications
2003,
Demange Marc
We study on-line versions of maximum weighted hereditary subgraph problems for which...
Some aspects of studying an optimization or decision problem in different computational models
2002,
Meer K.
In this paper we want to discuss some of the features coming up when analyzing a...
Voting power in the European Union enlargement
2002,
Bilbao J.M.
The Shapley–Shubik power index in a voting situation depends on the number of...
Solving the knapsack problem via ℤ-transform
2002,
Lasserre Jean B.
Given vectors a,c∈ℤ n and b ∈ℤ, we consider the (unbounded)...
Estimation of Swiss railway demand with computation of elasticities
1997,
Rolle Jean-Daniel
We adapt the ‘Almost Ideal Demand System’ (AIDS) from consumer expenditure...
Two efficient algorithms for the generalized maximum balanced flow problem
2002,
Nakayama Akira
Minoux considered the maximum balanced flow problem, i.e. the problem of finding a...
Evaluation of algorithms for one-dimensional cutting
2002,
Gradiar Miro
The paper deals with the prolem of evaluating and comparing different one-dimensional...
A parametric analysis of heuristics for the vehicle routing problem with side-constraints
2002,
Breedam Alex Van
The behavior of the parameters of 10 heuristics for the vehicle routing problem (VRP)...
The computational complexity of the criticality problems in a network with interval activity times
2002,
Chanas Stefan
The paper analyzes the criticality in a network with interval activities duration...
Study of optimal route choice based on fuzzy theory
2001,
Guan Guixia
Fuzzy theory was used to provide a best route for driver's efficient, fast,...
Evaluation and diagnosis model of enterprise environment using fuzzy analytical hierarchy process
2001,
Li Lin
The external environment for an enterprise is systematically analysed, and an index...
An algorithm for determining the k-best solutions of the one-dimensional knapsack problem
2000,
Yanasse H.H.
In this work we present an enumerative scheme for determining the K-best solutions (K...
Assessment of several algorithms for multi-period market equilibrium models with geometric distributed lag demand
2001,
Fuller J. David
With distributed lags, demand is a function of prices in the current and earlier...
The online traveling salesman problem against fair adversaries
2001,
Stougie Leen
In the online traveling saleman problem, requests for visits to cities (points in a...
A flexible Java representation for uncertainty in online operations-research models
2001,
Powell Warren B.
Online OR models have been the subject of increased attention in recent years with the...
A variable redefinition approach for the lot sizing problem with strong set-up interactions
2001,
Palekar Udatta S.
We address a variant of the Joint Replenishment Problem, in which the products can...
Single machine scheduling with step-deteriorating processing times
2001,
Cheng T.C. Edwin
We study in this paper a scheduling model in which each task has a normal processing...
First Page
4
5
6
7
8
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers