Convex combinatorial optimization
From MaRDI portal
Publication:1764165
DOI10.1007/s00454-004-1138-yzbMath1179.90289arXivmath/0309083OpenAlexW2001577580MaRDI QIDQ1764165
Publication date: 23 February 2005
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0309083
Related Items (27)
Zonotopes and the LP-Newton method ⋮ Parametric nonlinear discrete optimization over well-described sets and matroid intersections ⋮ The complexity of vector partition ⋮ Drawing graphs with vertices and edges in convex position ⋮ A note on the minimum number of edge-directions of a convex polytope ⋮ Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube ⋮ An efficient tree decomposition method for permanents and mixed discriminants ⋮ Nonlinear bipartite matching ⋮ On the largest convex subsets in Minkowski sums ⋮ Convex integer optimization by constantly many linear counterparts ⋮ A polytope approach to the optimal assembly problem ⋮ Efficient edge-skeleton computation for polytopes defined by oracles ⋮ \(N\)-fold integer programming ⋮ On nonlinear multi-covering problems ⋮ The use of edge-directions and linear programming to enumerate vertices ⋮ The partition bargaining problem ⋮ Efficient solutions for weight-balanced partitioning problems ⋮ Polyhedral results for a class of cardinality constrained submodular minimization problems ⋮ Graver basis and proximity techniques for block-structured separable convex integer minimization problems ⋮ Optimality conditions for maximizing a function over a polyhedron ⋮ Primitive zonotopes ⋮ The convex dimension of a graph ⋮ The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem ⋮ Convex integer maximization via Graver bases ⋮ Graphs of transportation polytopes ⋮ The vertices of primitive zonotopes ⋮ Edge-directions of standard polyhedra with applications to network flows
This page was built for publication: Convex combinatorial optimization
