ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
An O(n) algorithm for the linear multiple choice knapsack problem and related problems
Source Information Processing Letters archive
Volume 18 ,  Issue 3  (March 1984) table of contents
Pages: 123 - 128  
Year of Publication: 1984
ISSN:0020-0190
Author
Eitan Zemel  Northwestern Univ., Evanston, IL
Publisher
Elsevier North-Holland, Inc.  Amsterdam, The Netherlands, The Netherlands
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 10
Additional Information:

cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1016/0020-0190(84)90014-0

CITED BY  10
Juan A. Mesa , Justo Puerto , Arie Tamir, Improved algorithms for several network location problems with equality measures, Discrete Applied Mathematics, v.130 n.3, p.437-448, 23 August 2003
M. Colebrook , J. Gutiérrez , J. Sicilia, A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks, Computers and Operations Research, v.32 n.2, p.309-325, February 2005
Wlodzimierz Ogryczak , Arie Tamir, Minimizing the sum of the k largest functions in linear time, Information Processing Letters, v.85 n.3, p.117-122, 14 February 2003
George Kozanidis , Emanuel Melachrinoudis, A branch & bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints, Computers and Operations Research, v.31 n.5, p.695-711, April 2004
Alexander Barvinok , Sándor P. Fekete , David S. Johnson , Arie Tamir , Gerhard J. Woeginger , Russ Woodroofe, The geometric maximum traveling salesman problem, Journal of the ACM (JACM), v.50 n.5, p.641-664, September 2003
Pat Morin, An optimal randomized algorithm for d-variate zonoid depth, Computational Geometry: Theory and Applications, v.39 n.3, p.229-235, April, 2008
Yaron Kanza , Eliyahu Safra , Yehoshua Sagiv , Yerach Doytsher, Heuristic algorithms for route-search queries over geographical data, Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, November 05-07, 2008, Irvine, California
Lin Guo , Sihem Amer Yahia , Raghu Ramakrishnan , Jayavel Shanmugasundaram , Utkarsh Srivastava , Erik Vee, Efficient top-k processing over query-dependent functions, Proceedings of the VLDB Endowment, v.1 n.1, August 2008
J. Puerto , A. M. Rodríguez-Chía , A. Tamir, Minimax Regret Single-Facility Ordered Median Location Problems on Networks, INFORMS Journal on Computing, v.21 n.1, p.77-87, Winter 2009
George Kozanidis, Solving the linear multiple choice knapsack problem with two objectives: profit and equity, Computational Optimization and Applications, v.43 n.2, p.261-294, June 2009

INDEX TERMS

Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures

  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.6 Optimization
          Subjects: Linear programming


General Terms:
Algorithms, Performance

Collaborative Colleagues:
Eitan Zemel: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player