The following pages link to Presolving in linear programming (Q1914076):
Displaying 45 items.
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- Hopfield neural networks in large-scale linear optimization problems (Q428100) (← links)
- Regularization techniques in interior point methods (Q432801) (← links)
- Shift-and-propagate (Q524884) (← links)
- Broadening the integer programming audience, the LINDO perspective (Q537610) (← links)
- A comparative study of redundant constraints identification methods in linear programming problems (Q624719) (← links)
- Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
- Coefficient strengthening: a tool for reformulating mixed-integer programs (Q847848) (← links)
- Warm start by Hopfield neural networks for interior point methods (Q875399) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- Efficient preprocessing for VLSI optimization problems (Q967209) (← links)
- Adaptive demand peak management in online transport process planning (Q989614) (← links)
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
- Solving linear programming problems exactly (Q1354256) (← links)
- Interactions between nonlinear programming and modeling systems (Q1365050) (← links)
- Combinatorial optimization: current successes and directions for the future (Q1593834) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Design of planar articulated mechanisms using branch and bound (Q1780959) (← links)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
- Numerical aspects in developing LP softwares, LPAKO and LPABO (Q1872947) (← links)
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
- A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← links)
- Design and implementation of a modular interior-point solver for linear optimization (Q2062319) (← links)
- Sparse data-driven quadrature rules via \(\ell^p\)-quasi-norm minimization (Q2134455) (← links)
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization (Q2149553) (← 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)
- Unit-operation nonlinear modeling for planning and scheduling applications (Q2358139) (← links)
- On handling indicator constraints in mixed integer programming (Q2374361) (← links)
- Bound reduction using pairs of linear inequalities (Q2392123) (← links)
- A sparse proximal implementation of the LP dual active set algorithm (Q2465650) (← links)
- Dual multilevel optimization (Q2465655) (← links)
- Evolutionary approach for large-scale mine scheduling (Q2663534) (← links)
- Projection onto a polyhedron that exploits sparsity (Q2817841) (← links)
- Addendum to ``Presolve analysis of linear programs prior to applying an interior point method'' (Q2884503) (← links)
- Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
- Lower bound limit analysis of cohesive-frictional materials using second-order cone programming (Q3440472) (← links)
- An ADMM-based interior-point method for large-scale linear programming (Q4999335) (← links)
- Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data (Q5090518) (← links)
- Revisiting degeneracy, strict feasibility, stability, in linear programming (Q6113350) (← links)
- Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)
- Presolving linear bilevel optimization problems (Q6169995) (← links)
- A bidirectional evolutionary structural optimization algorithm for mass minimization with multiple structural constraints (Q6555367) (← links)
- A combined variable aggregation presolving technique for mixed integer programming (Q6564293) (← links)
