scientific article; zbMATH DE number 5165613
From MaRDI portal
Publication:5292089
zbMath1194.90100MaRDI QIDQ5292089
Publication date: 19 June 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (23)
A 3/2-Approximation for the Metric Many-Visits Path TSP ⋮ Some Results about the Contractions and the Pendant Pairs of a Submodular System ⋮ Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization ⋮ Matroid optimisation problems with nested non-linear monomials in the objective function ⋮ Submodular Functions: Learnability, Structure, and Optimization ⋮ A Discrete Convex Min-Max Formula for Box-TDI Polyhedra ⋮ Efficient Solution Methods for a General r-Interdiction Median Problem with Fortification ⋮ A bilevel programming problem with maximization of a supermodular function in the lower level ⋮ Lattice polyhedra and submodular flows ⋮ Computational geometric approach to submodular function minimization for multiclass queueing systems ⋮ Theory of Principal Partitions Revisited ⋮ On the complexity of submodular function minimisation on diamonds ⋮ A framework of discrete DC programming by discrete convex analysis ⋮ A Primal-Dual Algorithm for Weighted Abstract Cut Packing ⋮ The separation problem of rounded capacity inequalities: some polynomial cases ⋮ Locating tree-shaped facilities using the ordered median objective ⋮ Submodular function minimization ⋮ Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation ⋮ A faster strongly polynomial time algorithm for submodular function minimization ⋮ Minimization of locally defined submodular functions by optimal soft arc consistency ⋮ Covering Intersecting Bi-set Families under Matroid Constraints ⋮ Matroid optimization problems with monotone monomials in the objective ⋮ A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering
This page was built for publication:
