Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
From MaRDI portal
Publication:4015480
DOI10.1287/opre.40.5.885zbMath0758.90056OpenAlexW2168047345WikidataQ60140251 ScholiaQ60140251MaRDI QIDQ4015480
Roy E. Marsten, Irvin J. Lustig, John W. Gregory, David F. Shanno, Robert E. Bixby
Publication date: 5 January 1993
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1911/101715
interior point methodsimplex methodairline crew schedulingrelaxation of a set partitioningvery large-scale linear programs
Related Items
Interior-point algorithms for semi-infinite programming, Modeling the logistics response to a bioterrorist anthrax attack, Experimental investigations in combining primal dual interior point method and simplex based LP solvers, A dual strategy for solving the linear programming relaxation of a driver scheduling system, Relaxation heuristics for the set multicover problem with generalized upper bound constraints, Hybrid methods for lot sizing on parallel machines, Intelligent transportation systems -- Enabling technologies, Presolving in linear programming, Solving real-world linear ordering problems using a primal-dual interior point cutting plane method, Duty-period-based network model for crew rescheduling in European airlines, A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem, Some Perspectives on Strategic Forest Management Models and the Forest Products Supply Chain, Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems, Detecting critical node structures on graphs: A mathematical programming approach, Computational results with a primal-dual subproblem simplex method, Interior point stabilization for column generation, Improving a primal–dual simplex-type algorithm using interior point methods, A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem, Integer programming models for the multidimensional assignment problem with star costs, An efficient search direction for linear programming problems, An efficient column generation approach for practical railway crew scheduling with attendance rates, Robust crew pairing for managing extra flights, Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts, Optimization via simulation: A review, An inexact bundle variant suited to column generation, Design and implementation of a modular interior-point solver for linear optimization, Modelling and analysis of multistage stochastic programming problems: A software environment, A parallel primal-dual simplex algorithm, Degeneracy in interior point methods for linear programming: A survey, Pivot rules for linear programming: A survey on recent theoretical developments, Differential-algebraic approach to linear programming
Uses Software
