Multi-constrained matroidal knapsack problems-Reference-Cited by-同舟云学术

Multi-constrained matroidal knapsack problems

Published:1989-08 Issue:1-3 Volume:45 Page:211-231
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Camerini P. M.,Maffioli F.,Vercellis C.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01589104.pdf

Reference18 articles.

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman,Data Structures and Algorithms (Addison-Wesley, Reading, MA, 1983).

2. R.D. Armstrong, D.S. Kung, P. Sinha and A.A. Zoltners, “A computational study of a multiple-choice knapsack algorithm,”ACM Transactions on Mathematical Software 9 (1983) 184–198.

3. J.F. Balintfy, G.T. Ross, P. Sinha and A.A. Zoltners, “A mathematical programming system for preference-maximized nonselective menu planning and scheduling,”Mathematical Programming 15 (1978) 63–76.

4. D.P. Bertzekas,Constrained Optimization and Lagrange Multiplier Methods (Academic Press, Cambridge, 1982).

5. M. Bonatti, P.M. Camerini, L. Fratta, G. Gallassi and F. Maffioli, “A dynamic planning method for telecommunication networks and its performance evaluation for district trunk networks,”Proceedings of 10th International Teletraffic Congress (Montereal, Canada, 1983).

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Congruency-Constrained Matroid Base;Lecture Notes in Computer Science;2024

2. Decomposable multi-parameter matroid optimization problems;Theoretical Computer Science;2003-03

3. Multi-parameter Minimum Spanning Trees;Lecture Notes in Computer Science;2000

4. Geometric Lower Bounds for Parametric Matroid Optimization;Discrete & Computational Geometry;1998-12

5. Linear-time algorithms for parametric minimum spanning tree problems on planar graphs;Theoretical Computer Science;1997-07