Solving a mixed-integer multiobjective bond portfolio model involving logical conditions.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 497, doi. 10.1023/A:1018933929995
- By:
- Publication type:
- Article
Works matching IS 02545330 AND DT 1998 AND VI 81 AND IP 1-4
Results: 27
1
2
Modelling discrete optimisation problems in constraint logic programming.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 467, doi. 10.1023/A:1018981813157
- By:
- Publication type:
- Article
3
Assignment and sequencing models for the scheduling of process systems.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 433, doi. 10.1023/A:1018929829086
- By:
- Publication type:
- Article
4
Towards a closer integration of finite domain propagation and simplex-based algorithms.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 421, doi. 10.1023/A:1018977712248
- By:
- Publication type:
- Article
5
Integer programming approaches to facilities layout models with forbidden areas.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 405, doi. 10.1023/A:1018925728178
- By:
- Publication type:
- Article
6
On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 379, doi. 10.1023/A:1018973511339
- By:
- Publication type:
- Article
7
A method for solving ship routing problems with inventory constraints.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 357, doi. 10.1023/A:1018921527269
- By:
- Publication type:
- Article
8
On the set covering poly tope: Facets with coefficients in {0, 1, 2, 3}.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 343, doi. 10.1023/a:1018969410431
- By:
- Publication type:
- Article
9
An iterative algorithm for scheduling unit-time tasks with precedence constraints to minimise the maximum lateness.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 321, doi. 10.1023/A:1018917426360
- By:
- Publication type:
- Article
10
A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 307, doi. 10.1023/A:1018965309522
- By:
- Publication type:
- Article
11
A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 289, doi. 10.1023/A:1018961208614
- By:
- Publication type:
- Article
12
Solving the multi-airport Ground Holding Problem.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 271, doi. 10.1023/A:1018909224543
- By:
- Publication type:
- Article
13
Implementation of a steepest-edge primal--dual simplex method for network linear programs.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 251, doi. 10.1023/A:1018905123635
- By:
- Publication type:
- Article
14
Reformulation of the set partitioning problem as a pure network with special order set constraints.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 233, doi. 10.1023/A:1018953006796
- By:
- Publication type:
- Article
15
Chance-constrained stochastic programming for integrated services network management.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 213, doi. 10.1023/A:1018901022726
- By:
- Publication type:
- Article
16
Stochastic optimization with structured distributions: The case of Bayesian nets.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 189, doi. 10.1023/A:1018948905888
- By:
- Publication type:
- Article
17
Parallelization and aggregation of nested Benders decomposition.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 163, doi. 10.1023/A:1018996821817
- By:
- Publication type:
- Article
18
Dynamic stochastic programming for asset-liability management.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 131, doi. 10.1023/A:1018992620909
- By:
- Publication type:
- Article
19
A Newton-like approach to solving an equilibrium problem.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 115, doi. 10.1023/A:1018940604070
- By:
- Publication type:
- Article
20
A path following method for LCP with superlinearly convergent iteration sequence.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 97, doi. 10.1023/A:1018942131812
- By:
- Publication type:
- Article
21
A block active set algorithm for large-scale quadratic programming with box constraints.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 75, doi. 10.1023/A:1018990014974
- By:
- Publication type:
- Article
22
An algorithm for solving bicriterial linear programming problems with parametrical coefficients in the objective functions.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 63, doi. 10.1023/A:1018938030904
- By:
- Publication type:
- Article
23
Calculating the exact bounds of optimal values in LP with interval coefficients.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 51, doi. 10.1023/a:1018985914065
- By:
- Publication type:
- Article
24
ASYNPLEX, an asynchronous parallel revised simplex algorithm.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 27, doi. 10.1023/A:1018957107705
- By:
- Publication type:
- Article
25
A nonlinear path-following method for computing the equilibrium curve of structures.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 15, doi. 10.1023/a:1018944804979
- By:
- Publication type:
- Article
26
A nonconvex weighted potential function for polynomial target following methods.
- Published in:
- Annals of Operations Research, 1998, v. 81, n. 1-4, p. 3, doi. 10.1023/A:1018913325452
- By:
- Publication type:
- Article
27
Preface.
- Published in:
- 1998
- By:
- Publication type:
- Book Chapter