Pages that link to "Item:Q266404"
From MaRDI portal
The following pages link to Mathematical Programming Computation (Q266404):
Displaying 50 items.
- OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
- A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines (Q266405) (← links)
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- Minimizing the sum of many rational functions (Q266410) (← links)
- Improving branch-and-cut performance by random sampling (Q266414) (← links)
- A practical volume algorithm (Q298158) (← links)
- Communication protocols for options and results in a distributed optimization environment (Q298160) (← links)
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- Erratum to: ``CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization'' (Q298163) (← links)
- The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Phase retrieval for imaging problems (Q340015) (← links)
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
- A factorization with update procedures for a KKT matrix arising in direct optimal control (Q384809) (← links)
- A recipe for finding good solutions to MINLPs (Q384810) (← links)
- qpOASES: a parametric active-set algorithm for~quadratic programming (Q482109) (← links)
- Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
- Optimization of algorithms with OPAL (Q495935) (← links)
- Boosting the feasibility pump (Q495939) (← links)
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems (Q495943) (← links)
- On fast trust region methods for quadratic models with linear constraints (Q499155) (← links)
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm (Q499157) (← links)
- A parallel quadratic programming method for dynamic optimization problems (Q499159) (← links)
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints (Q499161) (← links)
- Faster min-max resource sharing in theory and practice (Q542051) (← links)
- Quadratic factorization heuristics for copositive programming (Q542052) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- Alternating direction augmented Lagrangian methods for semidefinite programming (Q621749) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection (Q621755) (← links)
- A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
- Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization (Q708777) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Blossom V: A new implementation of a minimum cost perfect matching algorithm (Q734352) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← links)
- On the safety of Gomory cut generators (Q744203) (← links)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
- TACO: a toolkit for AMPL control optimization (Q744209) (← links)
- GPU accelerated greedy algorithms for compressed sensing (Q744210) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- Matrix-free interior point method for compressed sensing problems (Q744215) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem (Q744218) (← links)
