The following pages link to Mathematical Programming (Q59162):
Displaying 22 items.
- An O(n) algorithm for the multiple-choice knapsack linear program (Q3315277) (← links)
- Sensitivity analysis for the asymmetric network equilibrium problem (Q3320098) (← links)
- Computing optimal scalings by parametric network algorithms (Q3691441) (← links)
- On Fan's minimax theorem (Q3717690) (← links)
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs (Q3757690) (← links)
- Dual gauge programs, with applications to quadratic programming and the minimum-norm problem (Q3770288) (← links)
- A note on perfect duality and limiting lagrangeans (Q3880596) (← links)
- Eliminating extraneous edges in Greenberg's algorithm (Q3892062) (← links)
- Heuristics for the fixed cost median problem (Q3929508) (← links)
- A polynomial algorithm for integer programming covering problems satisfying the integer round-up property (Q3929542) (← links)
- The value of the stochastic solution in stochastic linear programs with fixed recourse (Q3968764) (← links)
- A cost function property for plant location problems (Q4044368) (← links)
- Some convergence properties of the conjugate gradient method (Q4127902) (← links)
- An algorithm for determining all extreme points of a convex polytope (Q4159164) (← links)
- Forcing sparsity by projecting with respect to a non-diagonally weighted frobenius norm (Q4741645) (← links)
- A revised simplex method for linear multiple objective programs (Q4766797) (← links)
- Matching, Euler tours and the Chinese postman (Q4766817) (← links)
- Packing rooted directed cuts in a weighted directed graph (Q4769069) (← links)
- Validation of subgradient optimization (Q4770776) (← links)
- The traveling-salesman problem and minimum spanning trees: Part II (Q5641007) (← links)
- Matroids and the greedy algorithm (Q5668601) (← links)
- Edmonds polytopes and weakly hamiltonian graphs (Q5685112) (← links)
