Pages that link to "Item:Q3885530"

The following pages link to Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector (Q3885530):

Displayed 50 items.

• Flow sharing and bankruptcy games (Q532705) ‎ (← links)
• Monotonicity of social welfare optima (Q608542) ‎ (← links)
• Structural and algorithmic properties for parametric minimum cuts (Q715078) ‎ (← links)
• The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths (Q741538) ‎ (← links)
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) ‎ (← links)
• Submodular function minimization (Q995782) ‎ (← links)
• Linear and combinatorial sharing problems (Q1081535) ‎ (← links)
• Principal structures of submodular systems (Q1139052) ‎ (← links)
• On the solution of discrete bottleneck problems (Q1167061) ‎ (← links)
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) ‎ (← links)
• Generalization of a theorem on the parametric maximum flow problem (Q1208465) ‎ (← links)
• Minimizing a submodular function arising from a concave function (Q1304480) ‎ (← links)
• How to compute least infeasible flows (Q1373747) ‎ (← links)
• Minimization of an M-convex function (Q1392577) ‎ (← links)
• A push-relabel framework for submodular function minimization and applications to parametric optimization (Q1410685) ‎ (← links)
• Algorithms for separable convex optimization with linear ascending constraints (Q1628287) ‎ (← links)
• A note on balanced flows in equality networks (Q1730034) ‎ (← links)
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) ‎ (← links)
• Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) ‎ (← links)
• Towards equitable distribution via proportional equity constraints (Q1803612) ‎ (← links)
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) ‎ (← links)
• Equivalence of convex minimization problems over base polytopes (Q1926652) ‎ (← links)
• Merging and splitting in cooperative games: some (im)possibility results (Q1938833) ‎ (← links)
• Decreasing minimization on M-convex sets: background and structures (Q2089794) ‎ (← links)
• Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) ‎ (← links)
• A game theoretic approach to a problem in polymatroid maximization (Q2098075) ‎ (← links)
• Decreasing minimization on base-polyhedra: relation between discrete and continuous cases (Q2111551) ‎ (← links)
• Fair integral submodular flows (Q2166258) ‎ (← links)
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) ‎ (← links)
• Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) ‎ (← links)
• Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) ‎ (← links)
• Extended random assignment mechanisms on a family of good sets (Q2241324) ‎ (← links)
• Submodular optimization views on the random assignment problem (Q2330658) ‎ (← links)
• Parametric bisubmodular function minimization and its associated signed ring family (Q2357141) ‎ (← links)
• A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694) ‎ (← links)
• Theory of Principal Partitions Revisited (Q2971607) ‎ (← links)
• Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions (Q3322709) ‎ (← links)
• Generalized lexicographically optimal flows in networks with multiple sources and sinks (Q3668257) ‎ (← links)
• A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory (Q3682254) ‎ (← links)
• Optimal sharing (Q3941156) ‎ (← links)
• Active-set Methods for Submodular Minimization Problems (Q4637060) ‎ (← links)
• Convexity and Steinitz's exchange property (Q4645928) ‎ (← links)
• Lexicographically Optimal Base of a Submodular System with respect to a Weight Vector (Q4846556) ‎ (← links)
• Geometric Rescaling Algorithms for Submodular Function Minimization (Q4958557) ‎ (← links)
• A Discrete Convex Min-Max Formula for Box-TDI Polyhedra (Q5085130) ‎ (← links)
• On a Reduction for a Class of Resource Allocation Problems (Q5087712) ‎ (← links)
• Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints (Q5131701) ‎ (← links)
• The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential (Q5216797) ‎ (← links)
• Lexicographically optimal earliest arrival flows (Q6068531) ‎ (← links)
• An update-and-stabilize framework for the minimum-norm-point problem (Q6085996) ‎ (← links)