article

Linear programming in O(n × 3^d²) time

Author:

K L ClarksonAuthors Info & Claims

Information Processing Letters, Volume 22, Issue 1

Pages 21 - 24

https://doi.org/10.1016/0020-0190(86)90037-2

Published: 02 January 1986 Publication History

Abstract

No abstract available.

Cited By

View all

Jansen KRohwedder L(2023)On Integer Programming, Discrepancy, and ConvolutionMathematics of Operations Research10.1287/moor.2022.130848:3(1481-1495)Online publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1287/moor.2022.1308
Cslovjecsek JEisenbrand FHunkenschröder CRohwedder LWeismantel RMarx D(2021)Block-structured integer and linear programming in strongly polynomial and near linear timeProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458165(1666-1681)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458165
Assadi SKarpov NZhang QSuciu DSkritek SKoch C(2019)Distributed and Streaming Linear Programming in Low DimensionsProceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3294052.3319697(236-253)Online publication date: 25-Jun-2019
https://dl.acm.org/doi/10.1145/3294052.3319697
Show More Cited By

Index Terms

Linear programming in O(n × 3^d²) time

Recommendations

On linear programming relaxations for solving polynomial programming problems
Highlights
- Theoretically compared the tightness of the J-set relaxation with the recursive McCormick relaxations.
Abstract
This paper studies linear programming (LP) relaxations for solving polynomial programming problems. A polynomial programming problem can be equivalently formulated as a quadratically constrained quadratic program (QCQP) by introducing ...
Safe bounds in linear and mixed-integer linear programming

Current mixed-integer linear programming solvers are based on linear programming routines that use floating-point arithmetic. Occasionally, this leads to wrong solutions, even for problems where all coefficients and all solution components are small ...
Solving Bilevel Linear Programs Using Multiple Objective Linear Programming

We present an algorithm for solving bilevel linear programs that uses simplex pivots on an expanded tableau. The algorithm uses the relationship between multiple objective linear programs and bilevel linear programs along with results for minimizing a ...

Comments

Information & Contributors

Information

Published In

Information Processing Letters Volume 22, Issue 1

January 2, 1986

49 pages

ISSN:0020-0190

Editor:
G R Andrews

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 02 January 1986

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

38
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jansen KRohwedder L(2023)On Integer Programming, Discrepancy, and ConvolutionMathematics of Operations Research10.1287/moor.2022.130848:3(1481-1495)Online publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1287/moor.2022.1308
Cslovjecsek JEisenbrand FHunkenschröder CRohwedder LWeismantel RMarx D(2021)Block-structured integer and linear programming in strongly polynomial and near linear timeProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458165(1666-1681)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458165
Assadi SKarpov NZhang QSuciu DSkritek SKoch C(2019)Distributed and Streaming Linear Programming in Low DimensionsProceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3294052.3319697(236-253)Online publication date: 25-Jun-2019
https://dl.acm.org/doi/10.1145/3294052.3319697
CHAN T(2018)Improved Deterministic Algorithms for Linear Programming in Low DimensionsACM Transactions on Algorithms10.1145/315531214:3(1-10)Online publication date: 16-Jun-2018
https://dl.acm.org/doi/10.1145/3155312
Carvalho MLodi AMarcotte P(2018)A polynomial algorithm for a continuous bilevel knapsack problemOperations Research Letters10.1016/j.orl.2017.12.00946:2(185-188)Online publication date: 1-Mar-2018
https://dl.acm.org/doi/10.1016/j.orl.2017.12.009
Chan T(2016)Improved deterministic algorithms for linear programming in low dimensionsProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884519(1213-1219)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884519
Hansen TZwick UServedio RRubinfeld R(2015)An Improved Version of the Random-Facet Pivoting Rule for the Simplex AlgorithmProceedings of the forty-seventh annual ACM symposium on Theory of Computing10.1145/2746539.2746557(209-218)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2746539.2746557
Puerto JRodríguez-Chía ATamir A(2010)On the Planar Piecewise Quadratic 1-Center ProblemAlgorithmica10.5555/3118232.311851157:2(252-283)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.5555/3118232.3118511
Buzer L(2003)A linear incremental algorithm for naive and standard digital lines and planes recognitionGraphical Models10.1016/S1524-0703(03)00008-065:1-3(61-76)Online publication date: 1-Jan-2003
https://dl.acm.org/doi/10.1016/S1524-0703%2803%2900008-0
Fernández-Baca D(2003)Decomposable multi-parameter matroid optimization problemsTheoretical Computer Science10.1016/S0304-3975(02)00638-2297:1-3(183-198)Online publication date: 17-Mar-2003
https://dl.acm.org/doi/10.1016/S0304-3975%2802%2900638-2
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

On linear programming relaxations for solving polynomial programming problems

Safe bounds in linear and mixed-integer linear programming

Solving Bilevel Linear Programs Using Multiple Objective Linear Programming

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations