Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of large-scale symmetric travelling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Plane Algorithm for the Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Steiner Tree Problem on a Graph Using Branch and Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving matching problems with linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering an optimal LP basis from an interior point solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Primal- and Dual-Optimal Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes and column generation techniques with the projective algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving combinatorial optimization problems using Karmarkar's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short-Cut Potential Reduction Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4283447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A build-up variant of the logarithmic barrier method for LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for convex programming that uses analytic centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior point algorithm to solve computationally difficult set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a primal-dual interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Study of Indicators for Identifying Zero Variables in Interior-Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial method of approximate centers for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined phase I-phase II scaled potential algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02206819 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2164543827 / rank
 
Normal rank

Latest revision as of 08:21, 30 July 2024

scientific article
Language Label Description Also known as
English
Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
scientific article

    Statements

    Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (English)
    0 references
    0 references
    0 references
    1 July 1996
    0 references
    cutting plane methods
    0 references
    sequence of linear programs
    0 references
    cutting plane algorithm
    0 references
    linear ordering problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers