Pages that link to "Item:Q4108358"

The following pages link to Maximal Closure of a Graph and Applications to Combinatorial Problems (Q4108358):

Displaying 48 items.

• Production phase and ultimate pit limit design under commodity price uncertainty (Q320746) (← links)
• Aggregation heuristic for the open-pit block scheduling problem (Q321137) (← links)
• Some approaches for solving the general (\(t,k\))-design existence problem and other related problems (Q385139) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• A unified approach to finding good stable matchings in the hospitals/residents setting (Q930917) (← links)
• Computing sharp bounds for hard clustering problems on trees (Q1028427) (← links)
• The poset scheduling problem (Q1062616) (← links)
• Unimodular functions (Q1079493) (← links)
• An application of discrete mathematics in the design of an open pit mine (Q1110451) (← links)
• Lattice matrices, intersection of ring families and dicuts (Q1208350) (← links)
• A mathematical programming viewpoint for solving the ultimate pit problem (Q1296063) (← links)
• Minimizing a submodular function arising from a concave function (Q1304480) (← links)
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662) (← links)
• A distance constrained \(p\)-facility location problem on the real line (Q1340058) (← links)
• Optimum partitioning into intersections of ring families (Q1363743) (← links)
• Maximal closure on a graph with resource constraints (Q1366709) (← links)
• Least squares isotonic regression in two dimensions (Q1411527) (← links)
• A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time (Q1414243) (← links)
• Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
• A dynamic-material-value-based decomposition method for optimizing a mineral value chain with uncertainty (Q1751684) (← links)
• Combined optimisation of an open-pit mine outline and the transition depth to underground mining (Q1754360) (← links)
• Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods (Q1755382) (← links)
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505) (← links)
• A rounding technique for the polymatroid membership problem (Q1893104) (← links)
• Boolean regression (Q1904716) (← links)
• Ideal polytopes and face structures of some combinatorial optimization problems (Q1924055) (← links)
• 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 (Q2160495) (← links)
• A nonpositive curvature property of modular semilattices (Q2230980) (← links)
• A stable marriage requires communication (Q2278950) (← links)
• A new model for automated pushback selection (Q2289883) (← links)
• Polynomial time algorithm for an optimal stable assignment with multiple partners (Q2373720) (← links)
• A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694) (← links)
• Optimal mechanism design for the private supply of a public good (Q2435905) (← links)
• Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
• Submodular reassignment problem for reallocating agents to tasks with synergy effects (Q2673247) (← links)
• A new?old algorithm for minimum-cut and maximum-flow in closure graphs (Q2744651) (← links)
• Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem (Q2815443) (← links)
• Finding a Maximum-Weight Convex Set in a Chordal Graph (Q3121516) (← links)
• On the subdifferential of a submodular function (Q3332786) (← links)
• The Parametric Closure Problem (Q3449830) (← links)
• Stackelberg Max Closure with Multiple Followers (Q5870364) (← links)
• Minimum shared‐power edge cut (Q6066053) (← links)
• On the set of stable matchings in a bipartite graph (Q6078002) (← links)
• Applications and efficient algorithms for integer programming problems on monotone constraints (Q6087067) (← links)
• Speedup the optimization of maximal closure of a node-weighted directed acyclic graph (Q6105899) (← links)
• An efficient method for optimizing nested open pits with operational bottom space (Q6146633) (← links)
• Optimization of open-pit mine design and production planning with an improved floating cone algorithm (Q6173792) (← links)
• Adaptive randomization in network data (Q6200871) (← links)