The following pages link to Matthew J. Saltzman (Q1091253):
Displayed 16 items.
- A two-process implicit enumeration algorithm for the simple assembly line balancing problem (Q1091255) (← links)
- Recovering an optimal LP basis from an interior point solution (Q1342078) (← links)
- Item:Q1091253 (redirect page) (← links)
- Parallel branch, cut, and price for large-scale discrete optimization (Q1424299) (← links)
- A library hierarchy for implementing scalable parallel search algorithms (Q1771087) (← links)
- Software for an intelligent mathematical programming system (Q2086521) (← links)
- Facets of the three-index assignment polytope (Q2276881) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem (Q2815440) (← links)
- An Algorithm for the Three-Index Assignment Problem (Q3981514) (← links)
- Implementation of a Dual Affine Interior Point Algorithm for Linear Programming (Q4020667) (← links)
- Numerical Factorization Methods for Interior Point Algorithms (Q4291503) (← links)
- Statistical Analysis of Computational Tests of Algorithms and Heuristics (Q4427318) (← links)
- (Q4739038) (← links)
- The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method (Q4877505) (← links)
- Log transformations: What not to expect when you’re expecting (Q5079877) (← links)