Free Access

Notes—On a Selection Problem

M. L. Balinski
M. L. Balinski
Graduate Studies Division, City University of New York
Search for more papers by this author

M. L. Balinski

Graduate Studies Division, City University of New York

Search for more papers by this author

Published Online:1 Nov 1970https://doi.org/10.1287/mnsc.17.3.230

Cited by
- A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem
  European Journal of Operational Research, Vol. 323, No. 2
- Promotion Optimization for Multiple Items in Supermarkets
  Maxime C. Cohen,
  Jeremy J. Kalas,
  Georgia Perakis
  8 June 2020 | Management Science, Vol. 67, No. 4
- Optimizing Promotions for Multiple Items in Supermarkets
  15 December 2019
- The Parametric Closure Problem
  6 December 2017 | ACM Transactions on Algorithms, Vol. 14, No. 1
- Promotion Optimization in Retail
  SSRN Electronic Journal, Vol. 55
- Prioritization via Stochastic Optimization
  Ali Koç,
  David P. Morton
  15 May 2014 | Management Science, Vol. 61, No. 3
- The Parametric Closure Problem
  28 July 2015
- A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering
  3 May 2014
- Approximation Algorithms for Discrete Polynomial Optimization
  20 February 2013 | Journal of the Operations Research Society of China, Vol. 1, No. 1
- Interdiction Models and Applications
  29 September 2012
- Expressibility of Submodular Languages
- HP Transforms Product Portfolio Management with Operations Research
  Julie Ward,
  Bin Zhang,
  Shailendra Jain,
  Chris Fry,
  Thomas Olavson,
  Holger Mishal,
  Jason Amaral,
  Dirk Beyer,
  Ann Brecht,
  Brian Cargille,
  Russ Chadinha,
  Kathy Chou,
  Gavin DeNyse,
  Qi Feng,
  Cookie Padovani,
  Sesh Raj,
  Kurt Sunderbruch,
  Robert Tarjan,
  Krishna Venkatraman,
  Joseph Woods,
  Jing Zhou,
  1 February 2010 | Interfaces, Vol. 40, No. 1
- Advances in Business Analytics at HP Laboratories
  27 August 2010
- Solving LP Relaxations of Large-Scale Precedence Constrained Problems
- Dynamic evolution of economically preferred facilities
  European Journal of Operational Research, Vol. 193, No. 3
- Parametric Maximum Flow Algorithms for Fast Total Variation Minimization
  SIAM Journal on Scientific Computing, Vol. 31, No. 5
- Finding dense and isolated submarkets in a sponsored search spending graph
  6 November 2007
- Using critical sets to solve the maximum independent set problem
  Operations Research Letters, Vol. 35, No. 4
- Experimental Evaluation of Parametric Max-Flow Algorithms
- Network Modelling
- Balancing Applied to Maximum Network Flow Problems
- Single-Machine Scheduling with Precedence Constraints
  José R. Correa,
  Andreas S. Schulz,
  1 November 2005 | Mathematics of Operations Research, Vol. 30, No. 4
- An Approximation Algorithm for the Minimum Latency Set Cover Problem
- 50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today
  Dorit S. Hochbaum,
  1 June 2004 | Management Science, Vol. 50, No. 6
- Single Machine Scheduling with Precedence Constraints
  SSRN Electronic Journal, Vol. 4
- Solving Project Scheduling Problems by Minimum Cut Computations
  Rolf H. Möhring,
  Andreas S. Schulz,
  Frederik Stork,
  Marc Uetz,
  1 March 2003 | Management Science, Vol. 49, No. 3
- Introduction
- Minimum-Cost Feasible-Flow
- Trees
- Matching and Assignment
- Postman Problems
- Travelling Salesperson
- Tutorial hints
- Books and References
- Shortest Paths
- Maximum Flows
- How to Store a Network
- More about Shortest Paths
- Advanced Maximal Flow
- A new—old algorithm for minimum‐cut and maximum‐flow in closure graphs
  6 June 2001 | Networks, Vol. 37, No. 4
- Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem
  Dorit S. Hochbaum,
  Anna Chen,
  1 December 2000 | Operations Research, Vol. 48, No. 6
- Probabilistic Satisfiability
- On the SQAP-Polytope
  SIAM Journal on Optimization, Vol. 11, No. 2
- Capacitated selection problem
  Naval Research Logistics, Vol. 46, No. 1
- Approximation Algorithms for the k -Clique Covering Problem
  SIAM Journal on Discrete Mathematics, Vol. 9, No. 3
- A hierarchical approach for metal parts fabrication
  27 April 2007 | International Journal of Production Research, Vol. 33, No. 5
- Predicting Cause-Effect Relationships from Incomplete Discrete Observations
  SIAM Journal on Discrete Mathematics, Vol. 7, No. 4
- On Finding Critical Independent and Vertex Sets
  SIAM Journal on Discrete Mathematics, Vol. 7, No. 2
- Boolean polynomials and set functions
  Mathematical and Computer Modelling, Vol. 17, No. 9
- Appendix C: Selected Readings
  24 October 2011
- The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds
  Annals of Operations Research, Vol. 33, No. 3
- A new approach to optimal selection of services in health care organizations
  Socio-Economic Planning Sciences, Vol. 25, No. 1
- On the Reconfigurability of Hardware Accelerators for VLSI CAD tools
  2 June 2015 | IETE Journal of Research, Vol. 36, No. 3-4
- The boolean quadric polytope: Some characteristics, facets and relatives
  Mathematical Programming, Vol. 45, No. 1-3
- Modelling and solving an FMS part selection problem
  4 March 2011 | International Journal of Production Research, Vol. 27, No. 8
- A Fast Parametric Maximum Flow Algorithm and Applications
  SIAM Journal on Computing, Vol. 18, No. 1
- Logical testing for new approaches to mathematical programming modeling and analysis
  Computer Science in Economics and Management, Vol. 2, No. 1
- Neural networks, error-correcting codes, and polynomials over the binary n-cube
  IEEE Transactions on Information Theory, Vol. 35, No. 5
- Logical testing for rule-base management
  Annals of Operations Research, Vol. 12, No. 1
- Activity optimization games with complementarity
  European Journal of Operational Research, Vol. 28, No. 3
- Allocation of Documents in Two Level Memory for Information Retrieval Systems
- Order Relations of Variables in 0-1 Programming
- Unimodular functions
  Discrete Applied Mathematics, Vol. 14, No. 3
- Activity selection games and the minimum‐cut problem
  11 October 2006 | Networks, Vol. 13, No. 1
- Selected Applications of Minimum Cuts in Networks
  25 May 2016 | INFOR: Information Systems and Operational Research, Vol. 20, No. 4
- A solution method for the non-additive resource allocation problem in distributed system design
  Information Processing Letters, Vol. 15, No. 4
- A network flow solution to some nonlinear 0‐1 programming problems, with applications to graph theory
  11 October 2006 | Networks, Vol. 12, No. 2
- Quadratic knapsack problems
  24 February 2009
- On the structure of all minimum cuts in a network and applications
  25 February 2009
- Equilibrium Points in Nonzero-Sum n -Person Submodular Games
  SIAM Journal on Control and Optimization, Vol. 17, No. 6
- Letters to the Editor
  International Journal of Mathematical Education in Science and Technology, Vol. 10, No. 2
- Methods of Nonlinear 0-1 Programming
- The project coordinator's problem
  Omega, Vol. 6, No. 4
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Minimum cuts and related problems
  11 October 2006 | Networks, Vol. 5, No. 4
- Fonctions D’evaluation Et Penalites Pour Les Programmes Quadratiques En Variables 0–1

Volume 17, Issue 3

November 1970

Pages 127-246

Article Information

Metrics

Information

Published Online:November 01, 1970

Cite as

M. L. Balinski, (1970) Notes—On a Selection Problem. Management Science 17(3):230-231.

https://doi.org/10.1287/mnsc.17.3.230

PDF download

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Notes—On a Selection Problem

Volume 17, Issue 3

Article Information

Metrics

Information

Cite as

Sign Up for INFORMS Publications Updates and News