Pages that link to "Item:Q266404"
From MaRDI portal
The following pages link to Mathematical Programming Computation (Q266404):
Displaying 50 items.
- Block splitting for distributed optimization (Q744220) (← links)
- Incorporating bounds from decision diagrams into integer programming (Q823882) (← links)
- Signomial and polynomial optimization via relative entropy and partial dualization (Q823883) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization (Q823888) (← links)
- Polytope volume by descent in the face lattice and applications in social choice (Q823891) (← links)
- A first-order block-decomposition method for solving two-easy-block structured semidefinite programs (Q892382) (← links)
- A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
- PEBBL: an object-oriented framework for scalable parallel branch and bound (Q903924) (← links)
- Computational study of decomposition algorithms for mean-risk stochastic linear programs (Q903926) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- On solving trust-region and other regularised subproblems in optimization (Q977328) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- Support vector machine classification with indefinite kernels (Q1043851) (← links)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants (Q1043853) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- Detecting almost symmetries of graphs (Q1621684) (← links)
- \texttt{pyomo.dae}: a modeling and automatic discretization framework for optimization with differential and algebraic equations (Q1621687) (← links)
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
- Asynchronously parallel optimization solver for finding multiple minima (Q1621691) (← links)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity (Q1646680) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- Parallelizing the dual revised simplex method (Q1646685) (← links)
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems (Q1688449) (← links)
- Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
- New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem (Q1688454) (← links)
- Customizing the solution process of COIN-OR's linear solvers with python (Q1694292) (← links)
- Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation (Q1694294) (← links)
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix (Q1694296) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- A branch-and-bound algorithm for instrumental variable quantile regression (Q1697970) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Lifted collocation integrators for direct optimal control in ACADO toolkit (Q1697973) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
- Cubic regularization in symmetric rank-1 quasi-Newton methods (Q1741108) (← links)
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study (Q1741111) (← links)
- A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming (Q1741112) (← links)
