Pages that link to "Item:Q3635048"
From MaRDI portal
The following pages link to Solving Real-World Linear Programs: A Decade and More of Progress (Q3635048):
Displaying 50 items.
- Scenario aggregation method for portfolio expectile optimization (Q308418) (← links)
- Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
- The positive edge pricing rule for the dual simplex (Q337606) (← links)
- On an exact method for the constrained shortest path problem (Q339592) (← links)
- Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
- Scaling linear optimization problems prior to application of the simplex method (Q453620) (← links)
- A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs (Q480938) (← links)
- Boosting the feasibility pump (Q495939) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- A warm-start approach for large-scale stochastic linear programs (Q535016) (← links)
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method (Q630594) (← links)
- A GRASP with evolutionary path relinking for the truck and trailer routing problem (Q632678) (← links)
- Quadratic regularizations in an interior-point method for primal block-angular problems (Q652285) (← links)
- Approximating polyhedra with sparse inequalities (Q896289) (← links)
- A computational study of DEA with massive data sets (Q941542) (← links)
- Efficient nested pricing in the simplex algorithm (Q943787) (← links)
- George B. Dantzig and systems optimization (Q951088) (← links)
- Towards a practical parallelisation of the simplex method (Q970132) (← links)
- Planning production using mathematical programming: The case of a woodturning company (Q1013389) (← links)
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
- Parallel search paths for the simplex algorithm (Q1642812) (← links)
- Adaptive large neighborhood search on the graphics processing unit (Q1711444) (← links)
- Integer programming models for the pre-marshalling problem (Q1755240) (← links)
- Could we use a million cores to solve an integer program? (Q1935943) (← links)
- A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs (Q1989733) (← links)
- Learning chordal extensions (Q2046324) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (Q2062317) (← links)
- Scale characteristics of variable returns-to-scale production technologies with ratio inputs and outputs (Q2095919) (← links)
- Sparse PSD approximation of the PSD cone (Q2118107) (← links)
- Modeling emergency response operations: a theory building survey (Q2177817) (← links)
- A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models (Q2239936) (← links)
- A primal heuristic for optimizing the topology of gas networks based on dual information (Q2260914) (← links)
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← links)
- Risk-averse two-stage stochastic programs in furniture plants (Q2454333) (← links)
- A primal deficient-basis simplex algorithm for linear programming (Q2479158) (← links)
- Recovering an optimal LP basis from an optimal dual solution (Q2480056) (← links)
- A genetic algorithm for the project assignment problem (Q2485176) (← links)
- Hyper-sparsity in the revised simplex method and how to exploit it (Q2490370) (← links)
- Minimum-distance controlled perturbation methods for large-scale tabular data protection (Q2576244) (← links)
- An exact method for the biobjective shortest path problem for large-scale road networks (Q2630225) (← links)
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
- An interior-point approach for primal block-angular problems (Q2643610) (← links)
- Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm (Q2668804) (← links)
- Interior-point solver for convex separable block-angular problems (Q2811483) (← links)
- An improved mathematical program to solve the simple assembly line balancing problem (Q3055448) (← links)
- STOCHASTIC DOMINANCE: CONVEXITY AND SOME EFFICIENCY TESTS (Q3166713) (← links)
- A server for automated performance analysis of benchmarking data (Q3377976) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
