Ideal, weakly efficient solutions for vector optimization problems.
- Published in:
- Mathematical Programming, 2002, v. 93, n. 3, p. 453, doi. 10.1007/s10107-002-0311-4
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2002 AND VI 93 AND IP 3
Results: 6
1
2
An extended algorithm for separated continuous linear programs.
- Published in:
- Mathematical Programming, 2002, v. 93, n. 3, p. 415, doi. 10.1007/s10107-002-0307-0
- By:
- Publication type:
- Article
3
Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach.
- Published in:
- Mathematical Programming, 2002, v. 93, n. 3, p. 361, doi. 10.1007/s10107-002-0362-6
- By:
- Publication type:
- Article
4
Convex optimization problems involving finite autocorrelation sequences.
- Published in:
- Mathematical Programming, 2002, v. 93, n. 3, p. 331, doi. 10.1007/s10107-002-0334-x
- By:
- Publication type:
- Article
5
The relation of time indexed formulations of single machine scheduling problems to the node packing problem.
- Published in:
- Mathematical Programming, 2002, v. 93, n. 3, p. 477, doi. 10.1007/s10107-002-0335-9
- By:
- Publication type:
- Article
6
A decomposition procedure based on approximate Newton directions.
- Published in:
- Mathematical Programming, 2002, v. 93, n. 3, p. 495, doi. 10.1007/s10107-002-0304-3
- By:
- Publication type:
- Article