The following pages link to ACCPM (Q18789):
Displaying 50 items.
- V-shaped interval insensitive loss for ordinal classification (Q298286) (← links)
- Properties of the central points in linear programming problems (Q596665) (← links)
- Using central prices in the decomposition of linear programs (Q684317) (← links)
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
- BoxStep methods for crew pairing problems (Q833409) (← links)
- A variable metric method for nonsmooth convex constrained optimization (Q865537) (← links)
- A filter-variable-metric method for nonsmooth convex constrained optimization (Q1004165) (← links)
- Cutting planes and column generation techniques with the projective algorithm (Q1123123) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- A build-up variant of the logarithmic barrier method for LP (Q1200789) (← links)
- On improvements to the analytic center cutting plane method (Q1273420) (← links)
- Warm start of the primal-dual method applied in the cutting-plane scheme (Q1290656) (← links)
- Solving an equilibrium model for trade of \(\text{CO}_2\) emission permits (Q1291615) (← links)
- A two-cut approach in the analytic center cutting plane method (Q1299931) (← links)
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming (Q1327215) (← links)
- Specialized fast algorithms for IQC feasibility and optimization problems. (Q1428693) (← links)
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
- Using selective orthonormalization to update the analytic center after addition of multiple cuts (Q1780599) (← links)
- A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
- A new algorithm for minimizing convex functions over convex sets (Q1918926) (← links)
- A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- A cutting plane method for solving KYP-SDPs (Q2440612) (← links)
- An algorithm for bounded-error identification of nonlinear systems based on DC functions (Q2440614) (← links)
- Positivity and linear matrix inequalities (Q2512225) (← links)
- Multiple Cuts in the Analytic Center Cutting Plane Method (Q2706328) (← links)
- (Q2865859) (← links)
- New Stabilization Procedures for the Cutting Stock Problem (Q2899145) (← links)
- A Structure-Exploiting Tool in Algebraic Modeling Languages (Q3114643) (← links)
- Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation (Q3115938) (← links)
- Acceleration of cutting-plane and column generation algorithms: Applications to network design (Q3418117) (← links)
- Cutting-set methods for robust convex optimization with pessimizing oracles (Q3632942) (← links)
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm (Q4005806) (← links)
- A Potential Reduction Algorithm Allowing Column Generation (Q4018382) (← links)
- (Q4225025) (← links)
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods (Q4292667) (← links)
- (Q4355917) (← links)
- Probabilistic Analysis of a Combined Aggregation and Math Programming Heuristic for a General Class of Vehicle Routing and Scheduling Problems (Q4363659) (← links)
- On constrained optimization by adjoint based quasi-Newton methods (Q4405943) (← links)
- (Q4495139) (← links)
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering (Q4509784) (← links)
- (Q4527200) (← links)
- Polynomial Interior Point Cutting Plane Methods (Q4653547) (← links)
- Interior point cutting plane method for optimal power flow (Q4663103) (← links)
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver (Q4685752) (← links)
- Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993 (Q4764602) (← links)
- (Q4859839) (← links)
- An interior-point smoothing technique for Lagrangian relaxation in large-scale convex programming† (Q5449022) (← links)
