The following pages link to Ellis L. Johnson (Q210414):
Displayed 50 items.
- (Q163031) (redirect page) (← links)
- A least-squares minimum-cost network flow algorithm (Q646641) (← links)
- Logical processing for integer programming (Q817209) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- Operational airline reserve crew planning (Q880544) (← links)
- Polarity and the complexity of the shooting experiment (Q951126) (← links)
- Optimization of R\&D project portfolios under endogenous uncertainty (Q992625) (← links)
- Polyhedra of regular p-nary group problems (Q1121172) (← links)
- Experiments in integer programming (Q1137509) (← links)
- A characterization of minimal valid inequalities for mixed integer programs (Q1165157) (← links)
- A note on the knapsack problem with special ordered sets (Q1168894) (← links)
- Solving large scale crew scheduling problems (Q1278615) (← links)
- Min-cut clustering (Q1321669) (← links)
- Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
- Some properties of the fleet assignment problem (Q1332950) (← links)
- (Q1357765) (redirect page) (← links)
- The aircraft rotation problem (Q1357767) (← links)
- The relation of time indexed formulations of single machine scheduling problems to the node packing problem (Q1396279) (← links)
- Corner polyhedra and their connection with cutting planes (Q1424273) (← links)
- T-space and cutting planes (Q1424274) (← links)
- Cyclic group and knapsack facets (Q1424275) (← links)
- A parallel primal-dual simplex algorithm (Q1591540) (← links)
- Four problems on graphs with excluded minors (Q1823871) (← links)
- A least-squares primal-dual algorithm for solving linear programming problems (Q1866990) (← links)
- A three-phase approach to solving the bidline problem (Q1888188) (← links)
- The fleet assignment problem: Solving a large scale integer program (Q1906074) (← links)
- Cyclic group blocking polyhedra (Q1949270) (← links)
- Computational results with a primal-dual subproblem simplex method (Q1969761) (← links)
- Binary group facets with complete support and non-binary coefficients (Q2450757) (← links)
- Short-term booking of air cargo space (Q2503264) (← links)
- Branch-and-Price: Column Generation for Solving Huge Integer Programs (Q2770133) (← links)
- Branch-and-cut for combinatorial optimization problems without auxiliary binary variables (Q2775776) (← links)
- Flight String Models for Aircraft Fleeting and Routing (Q2783808) (← links)
- Airline Crew Recovery (Q2783897) (← links)
- An Optimization Based Heuristic for Political Districting (Q2784017) (← links)
- Primal-dual simplex method for shooting (Q2883641) (← links)
- Long-Range Reserve Crew Manpower Planning (Q3114901) (← links)
- (Q3199192) (← links)
- (Q3214707) (← links)
- Solving for an Optimal Airline Yield Management Policy via Statistical Learning (Q3435735) (← links)
- A Polyhedral Study of the Mixed Integer Cut (Q3569813) (← links)
- On the Generality of the Subadditive Characterization of Facets (Q3659534) (← links)
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs (Q3673580) (← links)
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models (Q3686428) (← links)
- Mappings and Facets for Nonabelian Group Problems (Q3686430) (← links)
- Solving Large-Scale Zero-One Linear Programming Problems (Q3696859) (← links)
- Binary group and Chinese postman polyhedra (Q3717740) (← links)
- The group problem and integer programming duality (Q3758560) (← links)
- Dual row modules and polyhedra of blocking group problems (Q3777799) (← links)
- (Q3863699) (← links)