Pages that link to "Item:Q266404"
From MaRDI portal
The following pages link to Mathematical Programming Computation (Q266404):
Displaying 50 items.
- Benders decomposition with adaptive oracles for large scale optimization (Q2063193) (← links)
- A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs (Q2063194) (← links)
- Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
- A penalized method of alternating projections for weighted low-rank Hankel matrix optimization (Q2088963) (← links)
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria (Q2088964) (← links)
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← links)
- Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization (Q2088969) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem (Q2099494) (← links)
- A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl (Q2099497) (← links)
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems (Q2125568) (← links)
- Optimal patchings for consecutive ones matrices (Q2125569) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees (Q2125571) (← links)
- \texttt{acados} -- a modular open-source framework for fast embedded optimal control (Q2125577) (← links)
- Adaptive large neighborhood search for mixed integer programming (Q2146445) (← links)
- An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems (Q2146447) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs (Q2146450) (← links)
- Efficient unconstrained black box optimization (Q2146451) (← links)
- A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising (Q2175442) (← links)
- A branch-and-price algorithm for capacitated hypergraph vertex separation (Q2175443) (← links)
- Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
- Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
- Special issue forward: The 2018 mixed integer programming workshop (Q2195677) (← links)
- On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- \(K\)-adaptability in two-stage mixed-integer robust optimization (Q2195680) (← links)
- Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
- Split cuts from sparse disjunctions (Q2195684) (← links)
- Robust Euclidean embedding via EDM optimization (Q2220896) (← links)
- Generation techniques for linear programming instances with controllable properties (Q2220897) (← links)
- A rotation-based branch-and-price approach for the nurse scheduling problem (Q2220898) (← links)
- An adaptive primal-dual framework for nonsmooth convex minimization (Q2220901) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
- A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery (Q2220914) (← links)
- Implementation of an interior point method with basis preconditioning (Q2220915) (← links)
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables (Q2220918) (← links)
- Asynchronous Lagrangian scenario decomposition (Q2246185) (← links)
- Hard to solve instances of the Euclidean traveling salesman problem (Q2246186) (← links)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- MiniCP: a lightweight solver for constraint programming (Q2246188) (← links)
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
- A structure-conveying modelling language for mathematical and stochastic programming (Q2267351) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- The (not so) trivial lifting in two dimensions (Q2281447) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
