Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
From MaRDI portal
Publication:3885530
DOI10.1287/moor.5.2.186zbMath0442.90071OpenAlexW2170569385MaRDI QIDQ3885530
Publication date: 1980
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.5.2.186
algorithmsensitivity analysisquadratic objective functionweight vectorlexicographically optimal flowlexicographically optimal base of a polymatroidnetwork with multiple sources and sinks
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic network models in operations research (90B10)
Related Items
Linear and combinatorial sharing problems, Convexity and Steinitz's exchange property, Algorithms for separable convex optimization with linear ascending constraints, Fair integral submodular flows, How to compute least infeasible flows, A Discrete Convex Min-Max Formula for Box-TDI Polyhedra, Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost, On a Reduction for a Class of Resource Allocation Problems, Monotonicity of social welfare optima, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Equivalence of convex minimization problems over base polytopes, Lexicographically Optimal Base of a Submodular System with respect to a Weight Vector, Minimization of an M-convex function, Principal structures of submodular systems, Lexicographically optimal earliest arrival flows, An update-and-stabilize framework for the minimum-norm-point problem, Merging and splitting in cooperative games: some (im)possibility results, A strongly polynomial algorithm for line search in submodular polyhedra, A push-relabel framework for submodular function minimization and applications to parametric optimization, Theory of Principal Partitions Revisited, On the solution of discrete bottleneck problems, Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints, A note on balanced flows in equality networks, Two algorithms for maximizing a separable concave function over a polymatroid feasible region, 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, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions, Flow sharing and bankruptcy games, Generalization of a theorem on the parametric maximum flow problem, Coordinatewise domain scaling algorithm for M-convex function minimization, Structural and algorithmic properties for parametric minimum cuts, Submodular function minimization, Geometric Rescaling Algorithms for Submodular Function Minimization, Towards equitable distribution via proportional equity constraints, The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths, The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential, Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times, Active-set Methods for Submodular Minimization Problems, Submodular optimization views on the random assignment problem, Generalized lexicographically optimal flows in networks with multiple sources and sinks, Decreasing minimization on M-convex sets: background and structures, Decreasing minimization on M-convex sets: algorithms and applications, Minimizing a submodular function arising from a concave function, A game theoretic approach to a problem in polymatroid maximization, Optimal sharing, A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory, Decreasing minimization on base-polyhedra: relation between discrete and continuous cases, Parametric bisubmodular function minimization and its associated signed ring family
