Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
From MaRDI portal
Cited in
(60)- Linear and combinatorial sharing problems
- Principal structures of submodular systems
- On the solution of discrete bottleneck problems
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- Generalization of a theorem on the parametric maximum flow problem
- Minimizing a submodular function arising from a concave function
- How to compute least infeasible flows
- Minimization of an M-convex function
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- Algorithms for separable convex optimization with linear ascending constraints
- A note on balanced flows in equality networks
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Coordinatewise domain scaling algorithm for M-convex function minimization
- Towards equitable distribution via proportional equity constraints
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- Equivalence of convex minimization problems over base polytopes
- Merging and splitting in cooperative games: some (im)possibility results
- Decreasing minimization on M-convex sets: background and structures
- Decreasing minimization on M-convex sets: algorithms and applications
- A game theoretic approach to a problem in polymatroid maximization
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
- Fair integral submodular flows
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
- Extended random assignment mechanisms on a family of good sets
- Submodular optimization views on the random assignment problem
- Parametric bisubmodular function minimization and its associated signed ring family
- A strongly polynomial algorithm for line search in submodular polyhedra
- Theory of principal partitions revisited
- Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions
- Generalized lexicographically optimal flows in networks with multiple sources and sinks
- A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory
- Optimal sharing
- Active-set Methods for Submodular Minimization Problems
- Convexity and Steinitz's exchange property
- Lexicographically Optimal Base of a Submodular System with respect to a Weight Vector
- Geometric rescaling algorithms for submodular function minimization
- A discrete convex min-max formula for box-TDI polyhedra
- On a Reduction for a Class of Resource Allocation Problems
- Machine speed scaling by adapting methods for convex optimization with submodular constraints
- The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
- Flow sharing and bankruptcy games
- Lexicographically optimal earliest arrival flows
- Monotonicity of social welfare optima
- An update-and-stabilize framework for the minimum-norm-point problem
- Minimizing symmetric convex functions over hybrid of continuous and discrete convex sets
- Two proofs of a structural theorem of decreasing minimization on integrally convex sets
- Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods
- Resource sharing revisited: local weak duality and optimal convergence
- Maximal workload, minimal workload, maximal workload difference: optimizing all criteria at once
- Modulus for bases of matroids
- An update-and-stabilize framework for the minimum-norm-point problem
- Structural and algorithmic properties for parametric minimum cuts
- Local density and its distributed approximation
- On deleting vertices to reduce density in graphs and supermodular functions
- \(\{s,t\}\)-separating principal partition sequence of submodular functions
- The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
- Submodular function minimization
This page was built for publication: Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885530)
