Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
From MaRDI portal
Publication:1915914
DOI10.1007/BF02206819zbMath0848.90086OpenAlexW2164543827MaRDI QIDQ1915914
Brian Borchers, John E. Mitchell
Publication date: 1 July 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02206819
Related Items
Large-scale optimization with the primal-dual column generation method, On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems, The linear ordering problem revisited, Using the primal-dual interior point algorithm within the branch-price-and-cut method, A survey on the linear ordering problem for weighted or unweighted tournaments, Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem, Robust Learning of Consumer Preferences, A new warmstarting strategy for the primal-dual column generation method, A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts, Block-insertion-based algorithms for the linear ordering problem, Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension, Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems, Workload balancing and loop layout in the design of a flexible manufacturing system
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational experience with a primal-dual interior point method for linear programming
- Solution of large-scale symmetric travelling salesman problems
- Cutting planes and column generation techniques with the projective algorithm
- A combined phase I-phase II scaled potential algorithm for linear programming
- An interior point algorithm to solve computationally difficult set covering problems
- Solving combinatorial optimization problems using Karmarkar's algorithm
- A polynomial method of approximate centers for linear programming
- A build-up variant of the logarithmic barrier method for LP
- Recovering an optimal LP basis from an interior point solution
- A cutting plane algorithm for convex programming that uses analytic centers
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Solving matching problems with linear programming
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On Finding Primal- and Dual-Optimal Bases
- Solving the Steiner Tree Problem on a Graph Using Branch and Cut
- A Short-Cut Potential Reduction Algorithm for Linear Programming
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
