Pages that link to "Item:Q4015480"
From MaRDI portal
The following pages link to Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods (Q4015480):
Displaying 32 items.
- Modeling the logistics response to a bioterrorist anthrax attack (Q323363) (← links)
- Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
- Duty-period-based network model for crew rescheduling in European airlines (Q880547) (← links)
- Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems (Q903045) (← links)
- Robust crew pairing for managing extra flights (Q1000996) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- Modelling and analysis of multistage stochastic programming problems: A software environment (Q1278966) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- A parallel primal-dual simplex algorithm (Q1591540) (← links)
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
- Optimization via simulation: A review (Q1805482) (← links)
- Differential-algebraic approach to linear programming (Q1862190) (← links)
- Experimental investigations in combining primal dual interior point method and simplex based LP solvers (Q1904702) (← links)
- A dual strategy for solving the linear programming relaxation of a driver scheduling system (Q1904740) (← links)
- Intelligent transportation systems -- Enabling technologies (Q1906952) (← links)
- Presolving in linear programming (Q1914076) (← links)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
- Computational results with a primal-dual subproblem simplex method (Q1969761) (← links)
- A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem (Q1991205) (← links)
- An efficient column generation approach for practical railway crew scheduling with attendance rates (Q2030362) (← links)
- Design and implementation of a modular interior-point solver for linear optimization (Q2062319) (← links)
- Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
- Interior point stabilization for column generation (Q2465956) (← links)
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) (← links)
- Solving large-scale linear programs by interior-point methods under the Matlab<sup>∗</sup>Environment<sup>†</sup> (Q4227923) (← links)
- Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
- Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
- A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem (Q5095157) (← links)
- An efficient search direction for linear programming problems (Q5955478) (← links)
- Some Perspectives on Strategic Forest Management Models and the Forest Products Supply Chain (Q6160216) (← links)