ACCPM
From MaRDI portal
Cited in
(69)- A long-step, cutting plane algorithm for linear and convex programming
- scientific article; zbMATH DE number 1064586 (Why is no real title available?)
- Using central prices in the decomposition of linear programs
- On improvements to the analytic center cutting plane method
- A Potential Reduction Algorithm Allowing Column Generation
- Efficient management of multiple sets to extract complex structures from mathematical programs
- New stabilization procedures for the cutting stock problem
- Parallel implementation of a central decomposition method for solving large-scale planning problems
- Cutting planes and column generation techniques with the projective algorithm
- Cutting-set methods for robust convex optimization with pessimizing oracles
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- A logarithmic barrier cutting plane method for convex programming
- A cutting plane algorithm for convex programming that uses analytic centers
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- scientific article; zbMATH DE number 2246591 (Why is no real title available?)
- Multiple cuts in the analytic center cutting plane method
- A two-cut approach in the analytic center cutting plane method
- Positivity and linear matrix inequalities
- Warm start of the primal-dual method applied in the cutting-plane scheme
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- V-shaped interval insensitive loss for ordinal classification
- Properties of the central points in linear programming problems
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- A new algorithm for minimizing convex functions over convex sets
- Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993
- Interior point cutting plane method for optimal power flow
- scientific article; zbMATH DE number 2227477 (Why is no real title available?)
- scientific article; zbMATH DE number 2189789 (Why is no real title available?)
- EMP
- HOPDM
- COFFIN
- KYPD
- NMTR
- Outward rotations
- MARKAL
- MORPH
- QDES
- ScenTrees.jl
- scientific article; zbMATH DE number 1241478 (Why is no real title available?)
- Using selective orthonormalization to update the analytic center after addition of multiple cuts
- scientific article; zbMATH DE number 1488009 (Why is no real title available?)
- Solving an equilibrium model for trade of \(\text{CO}_2\) emission permits
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- A cutting plane method for solving KYP-SDPs
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
- A variable metric method for nonsmooth convex constrained optimization
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- BoxStep methods for crew pairing problems
- Building and solving large-scale stochastic programs on an affordable distributed computing system
- Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation
- Probabilistic Analysis of a Combined Aggregation and Math Programming Heuristic for a General Class of Vehicle Routing and Scheduling Problems
- An interior-point smoothing technique for Lagrangian relaxation in large-scale convex programming†
- Specialized fast algorithms for IQC feasibility and optimization problems.
- An algorithm for bounded-error identification of nonlinear systems based on DC functions
- Stand_and_Adapt_Bend
- Solving combinatorial optimization problems using Karmarkar's algorithm
- Polynomial Interior Point Cutting Plane Methods
- A filter-variable-metric method for nonsmooth convex constrained optimization
- A build-up variant of the logarithmic barrier method for LP
- scientific article; zbMATH DE number 830380 (Why is no real title available?)
- scientific article; zbMATH DE number 1560348 (Why is no real title available?)
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- A Structure-Exploiting Tool in Algebraic Modeling Languages
- Disciplined convex programming
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- Solutions diversification in a column generation algorithm
- On constrained optimization by adjoint based quasi-Newton methods
This page was built for software: ACCPM
