Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations-Reference-Cited by-同舟云学术

Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations

Published:2002-07 Issue:2 Volume:140 Page:291-321
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Hochbaum Dorit S.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference40 articles.

1. Ahuja, R.K., Hochbaum, D.S., Orlin, J.B., 1999a. A cut based algorithm for the convex dual of the minimum cost network flow problem. Manuscript, UC Berkeley

2. Solving a convex dual of minimum cost flow;Ahuja,1999

3. Locating competitive new facilities in the presence of existing facilities;Ball,1992

4. A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine;Chudak;Operations Research Letters,1999

5. A strongly polynomial algorithm to solve combinatorial linear programs;Tardos;Operations Research,1986

Cited by 49 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties;Frontiers of Computer Science;2022-10-22

2. A simple rounding scheme for multistage optimization;Theoretical Computer Science;2022-03

3. Complexity and Polynomially Solvable Special Cases of QUBO;The Quadratic Unconstrained Binary Optimization Problem;2022

4. Data Reduction for Maximum Matching on Real-World Graphs;ACM Journal of Experimental Algorithmics;2021-12-31

5. Decreasing minimization on M-convex sets: background and structures;Mathematical Programming;2021-10-27