Minimizing a Convex Cost Closure Set

DOI10.1137/S0895480100369584zbMath1041.68070MaRDI QIDQ4443080

Maurice Queyranne, Dorit S. Hochbaum

Publication date: 8 January 2004

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

convex optimizationBayesian estimationmaximum flowclosure problemparametric minimum cutnonlinear costs

Mathematics Subject Classification ID

Nonlinear programming (90C30) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Related Items (19)

Approximation, characterization, and continuity of multivariate monotonic regression functions ⋮ Approximation algorithms for capacitated partial inverse maximum spanning tree problem ⋮ Estimating piecewise monotone signals ⋮ Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems ⋮ Speedup the optimization of maximal closure of a node-weighted directed acyclic graph ⋮ Efficient regularized isotonic regression with application to gene-gene interaction search ⋮ Pooling adjacent violators under interval constraints ⋮ A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ An iterated local search algorithm for the vehicle routing problem with convex time penalty functions ⋮ An iterated local search algorithm for the time-dependent vehicle routing problem with time windows ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ Complexity and algorithms for nonlinear optimization problems ⋮ A capacity scaling algorithm for M-convex submodular flow ⋮ Capacitated partial inverse maximum spanning tree under the weighted Hamming distance ⋮ Complexity and approximations for submodular minimization problems on two variables per inequality constraints ⋮ A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives ⋮ Partial inverse maximum spanning tree problem under the Chebyshev norm ⋮ Correction: Efficient regularized isotonic regression with application to gene-gene interaction search

This page was built for publication: Minimizing a Convex Cost Closure Set