Notes—On a Selection Problem

DOI10.1287/MNSC.17.3.230zbMath0203.52506OpenAlexW2086252904WikidataQ60174218 ScholiaQ60174218MaRDI QIDQ5603746

No author found.

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

Related Items (15)

Unimodular functions ⋮ The Parametric Closure Problem ⋮ Activity optimization games with complementarity ⋮ The Boolean quadratic polytope: Some characteristics, facets and relatives ⋮ Approximation algorithms for discrete polynomial optimization ⋮ The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds ⋮ Using critical sets to solve the maximum independent set problem ⋮ Modelling and solving an FMS part selection problem ⋮ A new?old algorithm for minimum-cut and maximum-flow in closure graphs ⋮ Dynamic evolution of economically preferred facilities ⋮ A hierarchical approach for metal parts fabrication ⋮ On project scheduling with irregular starting time costs ⋮ A solution method for the non-additive resource allocation problem in distributed system design ⋮ Boolean polynomials and set functions ⋮ A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering

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