scientific article; zbMATH DE number 1953186

Publication date: 25 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2570/25700011.htm

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

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Degrees of M-fuzzy families of independent L-fuzzy sets, On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint, Constant approximation for fault-tolerant median problems via iterative rounding, Excluded minors for the class of split matroids, Unnamed Item, An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties, Matroids and linking systems, The matroid intersection cover problem, Multiproduct Newsvendor Problem with Customer-Driven Demand Substitution: A Stochastic Integer Program Perspective, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, On clustering with discounts, Submodular functions: from discrete to continuous domains, Multi-objective matroid optimization with ordinal weights, Algorithms for maximizing monotone submodular function minus modular function under noise, Ehrhart theory of paving and panhandle matroids, Monotone diameter of bisubmodular polyhedra, Optimal hierarchical clustering on a graph, Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees, Recent progress on integrally convex functions, Solving Steiner trees: Recent advances, challenges, and perspectives, The Lovász-Cherkassky theorem in countable graphs, Clustered planarity testing revisited, Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints, A Unified Framework for Pricing in Nonconvex Resource Allocation Games, Expansion of random 0/1 polytopes, Improved bounds for the greedy strategy in optimization problems with curvature, A deterministic parallel reduction from weighted matroid intersection search to decision, On Fair Division under Heterogeneous Matroid Constraints, Multitrees in random graphs, Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours, Bicriteria algorithms for maximizing the difference between submodular function and linear function under noise, Bier spheres of extremal volume and generalized permutohedra, Comparative analysis of linear programming relaxations for the robust knapsack problem, Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs, Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual, Making Bipartite Graphs DM-Irreducible, Activity preserving graph simplification, Matroids on convex geometries: subclasses, operations, and optimization, Proof of Nash-Williams' intersection conjecture for countable matroids, On distributionally robust chance constrained programs with Wasserstein distance, Stronger MIP formulations for the Steiner forest problem, On the complexity of submodular function minimisation on diamonds, Faster algorithms for security games on matroids, Valuated matroid-based algorithm for submodular welfare problem, Rank functions of strict cg-matroids, An Exact Algorithm for the Steiner Forest Problem, Matroid base polytope decomposition, Parametric monotone function maximization with matroid constraints, Flag enumerations of matroid base polytopes, Combinatorial optimal control of semilinear elliptic PDEs, Facial structures of lattice path matroid polytopes, Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions, Approximation algorithms for the submodular edge cover problem with submodular penalties, Performance bounds with curvature for batched greedy optimization, An unbounded matroid intersection polyhedron, Matroid Designs of Prime Power Index, Intersection of a partitional and a general infinite matroid, The closure of a linear space in a product of lines, Box-total dual integrality, box-integrality, and equimodular matrices, Local unimodularity of matrix-vector pairs, Fast algorithms for maximizing monotone nonsubmodular functions, Fast algorithms for maximizing monotone nonsubmodular functions, Blocking, antiblocking, and pairs of matroids and polymatroids, Operator scaling: theory and applications, An exact cutting plane method for \(k\)-submodular function maximization, Routing for unmanned aerial vehicles: touring dimensional sets, The Tutte polynomial via lattice point counting, A quasisymmetric function for matroids, Ehrhart polynomials of matroid polytopes and polymatroids, Extended formulations of lower-truncated transversal polymatroids, A survey of fundamental operations on discrete convex functions of various kinds, Generalized skew bisubmodularity: a characterization and a min-max theorem, An adaptive algorithm for maximization of non-submodular function with a matroid constraint, A tight analysis of the submodular-supermodular procedure