Pages that link to "Item:Q4367045"

The following pages link to Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method (Q4367045):

Displaying 24 items.

• A heuristic algorithm for resource allocation/reallocation problem (Q410767) (← links)
• Hopfield neural networks in large-scale linear optimization problems (Q428100) (← links)
• Integer-programming software systems (Q817202) (← links)
• Warm start by Hopfield neural networks for interior point methods (Q875399) (← links)
• Efficient preprocessing for VLSI optimization problems (Q967209) (← links)
• Feasibility pump 2.0 (Q1043854) (← links)
• Modeling paradigms applied to the analysis of European air quality (Q1582183) (← links)
• Advances in design and implementation of optimization software (Q1598765) (← links)
• Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
• Multiple centrality corrections in a primal-dual method for linear programming (Q1816400) (← links)
• Numerical aspects in developing LP softwares, LPAKO and LPABO (Q1872947) (← links)
• Strong duality and minimal representations for cone optimization (Q1928754) (← links)
• Design and implementation of a modular interior-point solver for linear optimization (Q2062319) (← links)
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
• Two-row and two-column mixed-integer presolve using hashing-based pairing methods (Q2219510) (← links)
• Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
• A heuristic approach for identification of redundant constraints in linear programming models (Q3437363) (← links)
• Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes (Q3565464) (← links)
• LPAKO: A Simplex-based Linear Programming Program (Q4709753) (← links)
• An ADMM-based interior-point method for large-scale linear programming (Q4999335) (← links)
• Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints (Q5175471) (← links)
• Enhancing the behavior of interior-point methods via identification of variables (Q5426974) (← links)
• Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)
• Revisiting degeneracy, strict feasibility, stability, in linear programming (Q6113350) (← links)