Note on combinatorial optimization with max-linear objective functions
- 27 April 1993
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 42 (2-3), 139-145
- https://doi.org/10.1016/0166-218x(93)90043-n
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Multi-constrained matroidal knapsack problemsMathematical Programming, 1989
- Some NP-complete problems in quadratic and nonlinear programmingMathematical Programming, 1987
- Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problemsMathematical Programming, 1985
- On Optimizing Bin Picking and Insertion Plans for Assembly RobotsIIE Transactions, 1984
- The matroidal knapsack: A class of (often) well-solvable problemsOperations Research Letters, 1984
- Complexity of some parametric integer and network programming problemsMathematical Programming, 1983