scientific article; zbMATH DE number 3564689
From MaRDI portal
Publication:4136931
Cited in
(8)- Optimization under ordinal scales: When is a greedy solution optimal?
- A general Hungarian method for the algebraic transportation problem
- An improved general procedure for lexicographic bottleneck problems
- Lexicographic bottleneck problems
- Duality for algebraic linear programming
- Constrained partitioning problems
- Lexicographic optima in the multicriteria discrete optimization problem
- On the stabilization of resource usage for cyclical sequencing problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136931)