Journal: Annals of Operations Research

Found 3339 papers in total
Integer programming approaches to facilities layout models with forbidden areas
Integer programming approaches to facilities layout models with forbidden areas
1998,
The facilities layout problem is concerned with a given number of facilities of some...
Assignment and sequencing models for the scheduling of process systems
Assignment and sequencing models for the scheduling of process systems
1998,
This paper presents an overview of assignment and sequencing models that are used in...
An iterative algorithm for scheduling unit-time tasks with precedence constraints to minimise the maximum lateness
An iterative algorithm for scheduling unit-time tasks with precedence constraints to minimise the maximum lateness
1998,
We consider the maximum lateness problem in which all tasks have the same execution...
Parallelization and aggregation of nested Benders decomposition
Parallelization and aggregation of nested Benders decomposition
1998,
Dynamic multistage stochastic linear programming has many practical applications for...
On tightening 0–1 programs based on extensions of pure 0–1 knapsack and subset-sum problems
On tightening 0–1 programs based on extensions of pure 0–1 knapsack and subset-sum problems
1998,
We present a framework for automatic tightening of general 0–1 programs. A given...
Modelling discrete optimisation problems in constraint logic programming
Modelling discrete optimisation problems in constraint logic programming
1998,
Constraint logic programming has become a promising new technology for solving complex...
A nonconvex weighted potential function for polynomial target following methods
A nonconvex weighted potential function for polynomial target following methods
1998,
Long step interior-point methods in linear programming are some of the most efficient...
ASYNPLEX, an asynchronous parallel revised simplex algorithm
ASYNPLEX, an asynchronous parallel revised simplex algorithm
1998,
This paper describes ASYNPLEX, an asynchronous variant of the revised simplex method...
Calculating the exact bounds of optimal values in LP with interval coefficients
Calculating the exact bounds of optimal values in LP with interval coefficients
1998,
The paper deals with computing the exact upper and lower bounds of optimal values for...
An algorithm for solving bicriterial linear programming problems with parametrical coefficients in the objective functions
An algorithm for solving bicriterial linear programming problems with parametrical coefficients in the objective functions
1998,
The paper presents an algorithm for determining non-dominated basic solutions of the...
A path following method for LCP with superlinearly convergent iteration sequence
A path following method for LCP with superlinearly convergent iteration sequence
1998,
A new algorithm for solving linear complementarity problems with sufficient matrices...
Implementation of a steepest-edge primal–dual simplex method for network linear programs
Implementation of a steepest-edge primal–dual simplex method for network linear programs
1998,
A primal–dual simplex variant is presented that incrementally builds up the...
Towards a closer integration of finite domain propagation and simplex-based algorithms
Towards a closer integration of finite domain propagation and simplex-based algorithms
1998,
This paper describes our experience in implementing an industrial application using...
Imprecise sampling and direct decision making
Imprecise sampling and direct decision making
1998,
In decision theory, uncertainty is generally modeled through probabilities or...
The risk-structure dependence effect: Experimenting with an eye to decision-aiding
The risk-structure dependence effect: Experimenting with an eye to decision-aiding
1998,
In this paper, we aim at obtaining, from an experimental design in decision making...
Should we use simultaneous equations to model decision-making? A methodological note
Should we use simultaneous equations to model decision-making? A methodological note
1998,
This paper argues for a careful consideration of the methodological underpinnings of...
A note on the existence of continuous representations of homothetic preferences on a topological vector space
A note on the existence of continuous representations of homothetic preferences on a topological vector space
1998,
Let ⪯ be a complete preorder on a cone K in a topological vector space E , and...
Existence of additive utility on positive semigroups: An elementary proof
Existence of additive utility on positive semigroups: An elementary proof
1998,
This paper is concerned with the representability of totally ordered semigroups as...
Lamarckian genetic algorithms applied to the aggregation of preferences
Lamarckian genetic algorithms applied to the aggregation of preferences
1998,
The problem that we deal with consists in aggregating a set of individual preferences...
Characterizations of scoring methods for preference aggregation
Characterizations of scoring methods for preference aggregation
1998,
The paper surveys more than forty characterizations of scoring methods for preference...
Objectivity and subjectivity in the decision making process
Objectivity and subjectivity in the decision making process
1998,
Classical Operations Research assumed objectivity. Operations researchers hardly...
Numerical representation of choice functions
Numerical representation of choice functions
1998,
Numerical representations of choice functions allow the expression of a problem of...
Generalized utility based on values of opportunity sets
Generalized utility based on values of opportunity sets
1998,
This paper is concerned with an axiomatic approach to the analysis and construction of...
Extended partial orders: A unifying structure for abstract choice theory
Extended partial orders: A unifying structure for abstract choice theory
1998,
The concept of a strict extended partial order (SEPO) has turned out to be very useful...
Papers per page: