Maximal Closure of a Graph and Applications to Combinatorial Problems
From MaRDI portal
Publication:4108358
DOI10.1287/MNSC.22.11.1268zbMath0341.05112OpenAlexW2128208761WikidataQ56158137 ScholiaQ56158137MaRDI QIDQ4108358
Publication date: 1976
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.22.11.1268
Related Items (56)
Unimodular functions ⋮ A distance constrained \(p\)-facility location problem on the real line ⋮ The Parametric Closure Problem ⋮ Polynomial time algorithm for an optimal stable assignment with multiple partners ⋮ A rounding technique for the polymatroid membership problem ⋮ THE LAYERED NET SURFACE PROBLEMS IN DISCRETE GEOMETRY AND MEDICAL IMAGE SEGMENTATION ⋮ Production phase and ultimate pit limit design under commodity price uncertainty ⋮ Aggregation heuristic for the open-pit block scheduling problem ⋮ Boolean regression ⋮ Optimum partitioning into intersections of ring families ⋮ An application of discrete mathematics in the design of an open pit mine ⋮ A recursive time aggregation-disaggregation heuristic for the multidimensional and multiperiod precedence-constrained knapsack problem: an application to the open-pit mine block sequencing problem ⋮ Maximal closure on a graph with resource constraints ⋮ Ideal polytopes and face structures of some combinatorial optimization problems ⋮ Some approaches for solving the general (\(t,k\))-design existence problem and other related problems ⋮ Persuasion and dynamic communication ⋮ Submodular reassignment problem for reallocating agents to tasks with synergy effects ⋮ Minimum shared‐power edge cut ⋮ On the set of stable matchings in a bipartite graph ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ Applications and efficient algorithms for integer programming problems on monotone constraints ⋮ Speedup the optimization of maximal closure of a node-weighted directed acyclic graph ⋮ An efficient method for optimizing nested open pits with operational bottom space ⋮ A strongly polynomial algorithm for line search in submodular polyhedra ⋮ Optimization of open-pit mine design and production planning with an improved floating cone algorithm ⋮ Adaptive randomization in network data ⋮ Least squares isotonic regression in two dimensions ⋮ Optimal mechanism design for the private supply of a public good ⋮ A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time ⋮ A unified approach to finding good stable matchings in the hospitals/residents setting ⋮ A nonpositive curvature property of modular semilattices ⋮ A new?old algorithm for minimum-cut and maximum-flow in closure graphs ⋮ A dynamic-material-value-based decomposition method for optimizing a mineral value chain with uncertainty ⋮ Combined optimisation of an open-pit mine outline and the transition depth to underground mining ⋮ Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods ⋮ Complexity and algorithms for nonlinear optimization problems ⋮ Lattice matrices, intersection of ring families and dicuts ⋮ On the subdifferential of a submodular function ⋮ A Polyhedral Characterization of Border Bases ⋮ On project scheduling with irregular starting time costs ⋮ A stable marriage requires communication ⋮ On stable assignments generated by choice functions of mixed type ⋮ A new model for automated pushback selection ⋮ Affinely representable lattices, stable matchings, and choice functions ⋮ Affinely representable lattices, stable matchings, and choice functions ⋮ Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem ⋮ EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS ⋮ Computing sharp bounds for hard clustering problems on trees ⋮ A mathematical programming viewpoint for solving the ultimate pit problem ⋮ Finding a Maximum-Weight Convex Set in a Chordal Graph ⋮ Minimizing a submodular function arising from a concave function ⋮ A combinatorial algorithm minimizing submodular functions in strongly polynomial time. ⋮ The poset scheduling problem ⋮ Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations ⋮ Stackelberg Max Closure with Multiple Followers ⋮ Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
This page was built for publication: Maximal Closure of a Graph and Applications to Combinatorial Problems
