A relaxation/decomposition algorithm for the fixed charged network problem.
- Published in:
- Naval Research Logistics, 1990, v. 37, n. 2, p. 327, doi. 10.1002/1520-6750(199004)37:2<327::AID-NAV3220370210>3.0.CO;2-U
- By:
- Publication type:
- Article
Works matching IS 0894069X AND DT 1990 AND VI 37 AND IP 2
Results: 10
1
2
Design and performance analysis of consecutive- K-out-of- n structure.
- Published in:
- Naval Research Logistics, 1990, v. 37, n. 2, p. 203, doi. 10.1002/1520-6750(199004)37:2<203::AID-NAV3220370203>3.0.CO;2-X
- By:
- Publication type:
- Article
3
A bard-type method for a generalized linear complementarity problem with a nonsingular m-matrix.
- Published in:
- Naval Research Logistics, 1990, v. 37, n. 2, p. 279, doi. 10.1002/1520-6750(199004)37:2<279::AID-NAV3220370207>3.0.CO;2-V
- By:
- Publication type:
- Article
4
A correspondence principle for relative entropy minimization.
- Published in:
- Naval Research Logistics, 1990, v. 37, n. 2, p. 191, doi. 10.1002/1520-6750(199004)37:2<191::AID-NAV3220370202>3.0.CO;2-C
- By:
- Publication type:
- Article
5
An interactive MCDM weight space reduction method utilizing a tchebycheff utility function.
- Published in:
- Naval Research Logistics, 1990, v. 37, n. 2, p. 263, doi. 10.1002/1520-6750(199004)37:2<263::AID-NAV3220370206>3.0.CO;2-6
- By:
- Publication type:
- Article
6
Masthead.
- Published in:
- Naval Research Logistics, 1990, v. 37, n. 2, p. fmi, doi. 10.1002/1520-6750(199004)37:2<::AID-NAV3220370201>3.0.CO;2-B
- Publication type:
- Article
7
Formulating processing network models: Viability theory.
- Published in:
- Naval Research Logistics, 1990, v. 37, n. 2, p. 245, doi. 10.1002/1520-6750(199004)37:2<245::AID-NAV3220370205>3.0.CO;2-D
- By:
- Publication type:
- Article
8
A minimum-length covering subtree of a tree.
- Published in:
- Naval Research Logistics, 1990, v. 37, n. 2, p. 309, doi. 10.1002/1520-6750(199004)37:2<309::AID-NAV3220370209>3.0.CO;2-8
- By:
- Publication type:
- Article
9
An analysis of six greedy selection rules on a class of zero-one integer programming models.
- Published in:
- Naval Research Logistics, 1990, v. 37, n. 2, p. 299, doi. 10.1002/1520-6750(199004)37:2<299::AID-NAV3220370208>3.0.CO;2-M
- By:
- Publication type:
- Article
10
An assignment problem with queueing time cost.
- Published in:
- Naval Research Logistics, 1990, v. 37, n. 2, p. 231, doi. 10.1002/1520-6750(199004)37:2<231::AID-NAV3220370204>3.0.CO;2-N
- By:
- Publication type:
- Article