scientific article

No author found.

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

survey polynomial time algorithm discrete optimization submodular set functions submodular flow problem integrality properties of polyhedra Matroid Intersection Theorem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Polytopes and polyhedra (52Bxx)

Related Items (only showing first 100 items - show all)

On \(b\)-bistochastic quadratic stochastic operators ⋮ K-submodular functions and convexity of their Lovász extension ⋮ An ordered independence system and its applications to scheduling problems ⋮ Core-based criterion for extreme supermodular functions ⋮ Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique ⋮ A Mazur-Orlicz type theorem for submodular set functions ⋮ Quadratic M-convex and L-convex functions ⋮ The concave integral over large spaces ⋮ Greedy concepts for network flow problems ⋮ Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs ⋮ An out-of-kilter method for submodular flows ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem ⋮ Strong formulations for quadratic optimization with M-matrices and indicator variables ⋮ Equilibrium in a market of intellectual goods ⋮ Equilibrium analysis of an economy with innovations ⋮ A characterization of bisubmodular functions ⋮ Sandwich theorems for set functions ⋮ Enumerating disjunctions and conjunctions of paths and cuts in reliability theory ⋮ Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling ⋮ Generalized polymatroids and submodular flows ⋮ Optimization over the polyhedron determined by a submodular function on a co-intersecting family ⋮ Directed submodularity, ditroids and directed submodular flows ⋮ Lower probabilities and function representation ⋮ Recognition problems for special classes of polynomials in 0-1 variables ⋮ An FPTAS for optimizing a class of low-rank functions over a polytope ⋮ Perspectives of Monge properties in optimization ⋮ Matroids on convex geometries (cg-matroids) ⋮ Cores and Weber sets for fuzzy extensions of cooperative games ⋮ A submodular approach to discrete dynamic programming ⋮ \(k\)-additive aggregation functions and their characterization ⋮ The intermediate set and limiting superdifferential for coalitional games: between the core and the Weber set ⋮ Axiomatizations of Lovász extensions of pseudo-Boolean functions ⋮ Subjective independence and concave expected utility ⋮ The arity gap of order-preserving functions and extensions of pseudo-Boolean functions ⋮ A note on the Sobol' indices and interactive criteria ⋮ The search value of a set ⋮ Approximability of sparse integer programs ⋮ An inequality for polymatroid functions and its applications. ⋮ A greedy algorithm for convex geometries ⋮ New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. ⋮ Explicit convex and concave envelopes through polyhedral subdivisions ⋮ Absolutely determined matrices ⋮ Bipolarization of posets and natural interpolation ⋮ Distribution functions of linear combinations of lattice polynomials from the uniform distribu\-tion ⋮ Is submodularity testable? ⋮ A discrete choice model when context matters ⋮ A greedy algorithm for solving ordinary transportation problem with capacity constraints ⋮ Context dependent probabilistic choice models based on measures of binary advantage ⋮ On the complexity of submodular function minimisation on diamonds ⋮ Phylogenetic flexibility via Hall-type inequalities and submodularity ⋮ A simple proof for the convexity of the Choquet integral ⋮ Valuated matroid-based algorithm for submodular welfare problem ⋮ Extremality of submodular functions ⋮ Sandwich games ⋮ Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions ⋮ Lifting cover inequalities for the precedence-constrained knapsack problem ⋮ Equivalence of permutation polytopes corresponding to strictly supermodular functions ⋮ Efficient minimization of higher order submodular functions using monotonic Boolean functions ⋮ Restricted strong convexity implies weak submodularity ⋮ Graph cuts with interacting edge weights: examples, approximations, and algorithms ⋮ Polyhedral results for a class of cardinality constrained submodular minimization problems ⋮ Sensor selection for Kalman filtering of linear dynamical systems: complexity, limitations and greedy algorithms ⋮ Submodular functions in graph theory ⋮ Connectivity of submodular functions ⋮ Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs ⋮ A discrete Choquet integral for ordered systems ⋮ Aggregation-based extensions of fuzzy measures ⋮ A strategic product for belief functions ⋮ Maximization of the Choquet integral over a convex set and its application to resource allocation problems ⋮ Algebraic and topological closure conditions for classes of pseudo-Boolean functions ⋮ The expressive power of binary submodular functions ⋮ Global optimization for first order Markov random fields with submodular priors ⋮ Pseudo-Boolean optimization ⋮ Discrete convexity and unimodularity. I. ⋮ Bi-capacities. II: The Choquet integral ⋮ Monge extensions of cooperation and communication structures ⋮ Integrals based on monotone set functions ⋮ On set functions that can be extended to convex functionals ⋮ Generalized roof duality ⋮ Combinatorial optimal control of semilinear elliptic PDEs ⋮ A short convex-hull proof for the all-different system with the inclusion property ⋮ Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs ⋮ Strong formulations for conic quadratic optimization with indicator variables ⋮ Approximation algorithms for the multiprocessor scheduling with submodular penalties ⋮ Attribute based diversification of seeds for targeted influence maximization ⋮ On the moments and distribution of discrete Choquet integrals from continuous distributions ⋮ Maximization of submodular functions: theory and enumeration algorithms ⋮ Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case ⋮ Scheduling multiprocessor UET tasks of two sizes ⋮ Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2 ⋮ Discrete convex analysis ⋮ A note on submodular set cover on matroids ⋮ A combinatorial approach to level of repair analysis ⋮ Extension of M-convexity and L-convexity to polyhedral convex functions ⋮ A note on Frank's generalized polymatroids ⋮ A combinatorial algorithm minimizing submodular functions in strongly polynomial time. ⋮ A fully combinatorial algorithm for submodular function minimization. ⋮ Fuzzy shortest paths ⋮ Separation of partition inequalities for the \((1,2)\)-survivable network design problem

This page was built for publication: