Applications and efficient algorithms for integer programming problems on monotone constraints

DOI10.1002/net.21983OpenAlexW3089914116MaRDI QIDQ6087067

Dorit S. Hochbaum

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21983

zbMATH Keywords

integer programmingimage segmentationnetwork flowparametric cutmonotone inequalitiesratio problems

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Unnamed Item
• Nuclear threat detection with mobile distributed sensor networks
• Evaluating performance of image segmentation criteria and techniques
• Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
• A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
• A comparative study of the leading machine learning techniques and two new optimization algorithms
• HNCcorr: combinatorial optimization for neuron identification
• Multi-Label Markov Random Fields as an Efficient and Effective Tool for Image Segmentation, Total Variations and Regularization
• Maximal Flow Through a Network
• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
• A Fast Parametric Maximum Flow Algorithm and Applications
• A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant
• An efficient algorithm for image segmentation, Markov random fields and related problems

This page was built for publication: Applications and efficient algorithms for integer programming problems on monotone constraints