Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

On the generation of metric TSP instances with a large integrality gap by branch-and-cut: Label: en
Feasibility jump: an LP-free Lagrangian MIP heuristic: Label: en
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization: Label: en
A branch and bound algorithm for robust binary optimization with budget uncertainty: Label: en
A memetic procedure for global multi-objective optimization: Label: en
A dynamic programming approach for generalized nearly isotonic optimization: Label: en
A data driven Dantzig-Wolfe decomposition framework: Label: en
Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations: Label: en
Performance enhancements for a generic conic interior point algorithm: Label: en
Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds: Label: en
JuMP 1.0: recent improvements to a modeling language for mathematical optimization: Label: en
Efficient MIP techniques for computing the relaxation complexity: Label: en
Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems: Label: en
Parallel and distributed asynchronous adaptive stochastic gradient methods: Label: en
Faster exact solution of sparse maxcut and QUBO problems: Label: en
Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization: Label: en
Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem: Label: en
A computational study of perspective cuts: Label: en
A hierarchy of spectral relaxations for polynomial optimization: Label: en
Computing minimum-volume enclosing ellipsoids: Label: en
A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty: Label: en
Enumeration of 2-level polytopes: Label: en
On solving a hard quadratic 3-dimensional assignment problem: Label: en
Solving network design problems via iterative aggregation: Label: en
Generalized alternating direction method of multipliers: new theoretical insights and applications: Label: en
The strength of multi-row models: Label: en
On efficiently combining limited-memory and trust-region techniques: Label: en
Improved branch-cut-and-price for capacitated vehicle routing: Label: en
Fast separation for the three-index assignment problem: Label: en
Computing convex hulls and counting integer points with \texttt{polymake}: Label: en
Parallel stochastic gradient algorithms for large-scale matrix completion: Label: en
Local cuts for mixed-integer programming: Label: en
Efficient block-coordinate descent algorithms for the group Lasso: Label: en
Trajectory-following methods for large-scale degenerate convex quadratic programming: Label: en
Cutting plane versus compact formulations for uncertain (integer) linear programs: Label: en
A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition: Label: en
LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison: Label: en
A penalty-interior-point algorithm for nonlinear constrained optimization: Label: en
On optimizing over lift-and-project closures: Label: en
PySP: modeling and solving stochastic programs in Python: Label: en
Methods for convex and general quadratic programming: Label: en
Alternating proximal gradient method for sparse nonnegative Tucker decomposition: Label: en
Global optimization of nonconvex problems with multilinear intermediates: Label: en
An active set algorithm for robust combinatorial optimization based on separation oracles: Label: en
OAR lib: an open source arc routing library: Label: en
Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs: Label: en
Solving equilibrium problems using extended mathematical programming: Label: en
Solving quadratic programs to high precision using scaled iterative refinement: Label: en
Certifiably optimal sparse principal component analysis: Label: en
New exact approaches to row layout problems: Label: en