Maximal Closure of a Graph and Applications to Combinatorial Problems
From MaRDI portal
Cited in
(58)- Computing sharp bounds for hard clustering problems on trees
- The poset scheduling problem
- Unimodular functions
- An application of discrete mathematics in the design of an open pit mine
- Lattice matrices, intersection of ring families and dicuts
- A mathematical programming viewpoint for solving the ultimate pit problem
- Minimizing a submodular function arising from a concave function
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- A distance constrained p-facility location problem on the real line
- Optimum partitioning into intersections of ring families
- Maximal closure on a graph with resource constraints
- Least squares isotonic regression in two dimensions
- A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- 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
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A rounding technique for the polymatroid membership problem
- Boolean regression
- Ideal polytopes and face structures of some combinatorial optimization problems
- 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
- A nonpositive curvature property of modular semilattices
- A stable marriage requires communication
- A new model for automated pushback selection
- Polynomial time algorithm for an optimal stable assignment with multiple partners
- A strongly polynomial algorithm for line search in submodular polyhedra
- Optimal mechanism design for the private supply of a public good
- Complexity and algorithms for nonlinear optimization problems
- Submodular reassignment problem for reallocating agents to tasks with synergy effects
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- Finding all stable pairs and solutions to the many-to-many stable matching problem
- Finding a maximum-weight convex set in a chordal graph
- Production phase and ultimate pit limit design under commodity price uncertainty
- Aggregation heuristic for the open-pit block scheduling problem
- On the subdifferential of a submodular function
- EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS
- Some approaches for solving the general (t,k)-design existence problem and other related problems
- The unconstrained binary quadratic programming problem: a survey
- Persuasion and dynamic communication
- THE LAYERED NET SURFACE PROBLEMS IN DISCRETE GEOMETRY AND MEDICAL IMAGE SEGMENTATION
- A Polyhedral Characterization of Border Bases
- Stackelberg Max Closure with Multiple Followers
- Affinely representable lattices, stable matchings, and choice functions
- Affinely representable lattices, stable matchings, and choice functions
- On project scheduling with irregular starting time costs
- Minimum shared‐power edge cut
- On the set of stable matchings in a bipartite graph
- 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
- Optimization of open-pit mine design and production planning with an improved floating cone algorithm
- Adaptive randomization in network data
- On stable assignments generated by choice functions of mixed type
- Solving multivariate Coppersmith problems with known moduli
- A complexity map of probabilistic reasoning for neurosymbolic classification techniques
- Stable matchings, choice functions, and linear orders
- A unified approach to finding good stable matchings in the hospitals/residents setting
This page was built for publication: Maximal Closure of a Graph and Applications to Combinatorial Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4108358)
