Solving Real-World Linear Programs: A Decade and More of Progress
From MaRDI portal
Publication:3635048
DOI10.1287/opre.50.1.3.17780zbMath1163.90643OpenAlexW2139559439MaRDI QIDQ3635048
Publication date: 3 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.50.1.3.17780
Related Items
Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs, STOCHASTIC DOMINANCE: CONVEXITY AND SOME EFFICIENCY TESTS, An exact method for the biobjective shortest path problem for large-scale road networks, Scenario aggregation method for portfolio expectile optimization, Parallel search paths for the simplex algorithm, Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms, An interior-point approach for primal block-angular problems, Computing in Operations Research Using Julia, Solving the orienteering problem with time windows via the pulse framework, The positive edge pricing rule for the dual simplex, On an exact method for the constrained shortest path problem, The interior-point revolution in optimization: History, recent developments, and lasting consequences, Cutting Plane Generation through Sparse Principal Component Analysis, Implementing the simplex method as a cutting-plane method, with a view to regularization, Modeling emergency response operations: a theory building survey, Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm, A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale, Learning sparse nonlinear dynamics via mixed-integer optimization, Could we use a million cores to solve an integer program?, Compressing branch-and-bound trees, An exact bidirectional pulse algorithm for the constrained shortest path, Jointly Optimizing Selection of Fuel Treatments and Siting of Forest Biomass-Based Energy Production Facilities for Landscape-Scale Fire Hazard Reduction, Approximating polyhedra with sparse inequalities, A constraint programming approach for the premarshalling problem, Revisiting degeneracy, strict feasibility, stability, in linear programming, Progress in mathematical programming solvers from 2001 to 2020, Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method, A GRASP with evolutionary path relinking for the truck and trailer routing problem, Adaptive large neighborhood search on the graphics processing unit, Scaling linear optimization problems prior to application of the simplex method, Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models, Quadratic regularizations in an interior-point method for primal block-angular problems, Risk-averse two-stage stochastic programs in furniture plants, A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, A computational study of DEA with massive data sets, Boosting the feasibility pump, Efficient nested pricing in the simplex algorithm, A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models, George B. Dantzig and systems optimization, A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs, Interior Point Methods for Nonlinear Optimization, Three enhancements for optimization-based bound tightening, Integer programming models for the pre-marshalling problem, A primal deficient-basis simplex algorithm for linear programming, Recovering an optimal LP basis from an optimal dual solution, A warm-start approach for large-scale stochastic linear programs, A genetic algorithm for the project assignment problem, Towards a practical parallelisation of the simplex method, A primal heuristic for optimizing the topology of gas networks based on dual information, Hyper-sparsity in the revised simplex method and how to exploit it, An improved mathematical program to solve the simple assembly line balancing problem, Learning chordal extensions, A server for automated performance analysis of benchmarking data, Interior-point solver for convex separable block-angular problems, Planning production using mathematical programming: The case of a woodturning company, Vector Space Decomposition for Solving Large-Scale Linear Programs, Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II, MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library, Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation, Graphs and Algorithms in Communication Networks on Seven League Boots, Book Review: The basic George B. Dantzig, Conflict Analysis for MINLP, Scale characteristics of variable returns-to-scale production technologies with ratio inputs and outputs, Minimum-distance controlled perturbation methods for large-scale tabular data protection, Sparse PSD approximation of the PSD cone, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
Uses Software
