A Selection Problem of Shared Fixed Costs and Network Flows

DOI10.1287/mnsc.17.3.200zbMath0203.52505OpenAlexW2167925113WikidataQ60395642 ScholiaQ60395642MaRDI QIDQ5603745

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.200

Related Items

Unimodular functions, On exact solution approaches for bilevel quadratic 0-1 knapsack problem, Introduction to QUBO, Autarkies and Persistencies for QUBO, The Parametric Closure Problem, Polynomial time algorithm for an optimal stable assignment with multiple partners, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, The Expressive Power of Binary Submodular Functions, Planning for conjunctive goals, Recognition of a class of unimodular functions, An algorithm for indefinite integer quadratic programming, Strong unimodularity for matrices and hypergraphs, Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems, Maximal closure on a graph with resource constraints, Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions, The quadratic knapsack problem -- a survey, The Boolean quadratic polytope: Some characteristics, facets and relatives, Rounding algorithms for covering problems, Classes of submodular constraints expressible by graph cuts, Approximation algorithms for discrete polynomial optimization, Some thoughts on combinatorial optimisation, The unconstrained binary quadratic programming problem: a survey, Roof duality for polynomial 0–1 optimization, A semantic relatedness preserved subset extraction method for language corpora based on pseudo-Boolean optimization, Pareto robust optimization on Euclidean vector spaces, On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem, On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization, Global optimality conditions and optimization methods for quadratic knapsack problems, Selecting a discrete portfolio, Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods, Using separation algorithms to generate mixed integer model reformulations, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Using critical sets to solve the maximum independent set problem, A polynomial case of convex integer quadratic programming problems with box integer constraints, A network approach for specially structured linear programs arising in 0-1 quadratic optimization, Efficient minimization of higher order submodular functions using monotonic Boolean functions, The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications, 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, Best reduction of the quadratic semi-assignment problem, The expressive power of binary submodular functions, Pseudo-Boolean optimization, A hierarchical approach for metal parts fabrication, On project scheduling with irregular starting time costs, A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems, Structural and algorithmic properties for parametric minimum cuts, Clique-connecting forest and stable set polytopes, Unconstrained 0-1 optimization and Lagrangean relaxation, Differential approximation schemes for half-product related functions and their scheduling applications, Approximability issues for unconstrained and constrained maximization of half-product related functions, Lagrangian heuristics for the quadratic knapsack problem, The directed profitable location rural postman problem, Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation, Facility siting and integer-friendly programming, Cliques and clustering: A combinatorial approach, Finding a Maximum-Weight Convex Set in a Chordal Graph, The allocation of shared fixed costs, Unconstrained quadratic bivalent programming problem, A combinatorial algorithm minimizing submodular functions in strongly polynomial time., Boolean polynomials and set functions, Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm, Valid inequalities and separation for uncapacitated fixed charge networks, On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems, Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions, A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering, The Steiner tree polytope and related polyhedra, Roof duality, complementation and persistency in quadratic 0–1 optimization, The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases