Notes—On a Selection Problem

DOI10.1287/MNSC.17.3.230MaRDI QIDQ5603746zbMATH OpenOpenAlexWikidataFDO

Authors Michel Balinski

Publication date 1970

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.17.3.230

Cited in

(15)

• A solution method for the non-additive resource allocation problem in distributed system design
• Unimodular functions
• Activity optimization games with complementarity
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
• Boolean polynomials and set functions
• Using critical sets to solve the maximum independent set problem
• A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
• Modelling and solving an FMS part selection problem
• Approximation algorithms for discrete polynomial optimization
• A hierarchical approach for metal parts fabrication
• A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
• On project scheduling with irregular starting time costs
• A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem
• Dynamic evolution of economically preferred facilities

This page was built for publication: Notes—On a Selection Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5603746)