Cited in
(51)- Solving the staircase cost facility location problem with decomposition and piecewise linearization
- A survey of dynamic network flows
- A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space
- Conditional subgradient optimization -- theory and applications
- Branch-and-cut solution of inference problems in propositional logic
- A simple SLP algorithm for solving a class of nonlinear programs
- A new heuristic for the period traveling salesman problem
- A bootstrap heuristic for designing minimum cost survivable networks
- Solving discrete stochastic linear programs with simple recourse by the dualplex algorithm
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- Sensitivity method for basis inverse representation in multistage stochastic linear programming problems
- The capacity expansion problem in the service industry
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Large-scale 0-1 linear programming on distributed workstations
- The effects of exogenous variables in efficiency measurement -- a Monte Carlo study
- Distribution system planning through a generalized Benders decomposition approach
- A purification algorithm for semi-infinite programming
- Vehicle crew scheduling to complete specific tasks and bulk-tasks at depots
- Design of private backbone networks. I: Time varying traffic
- Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem
- Coal bank scheduling using a mathematical programming model
- Enhanced intersection cutting-plane approach for linear complementarity problems
- Penalty computations for the set partitioning problem
- Algorithms for large scale set covering problems
- The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
- A note on the pivot and complement heuristic for 0-1 programming problems
- Generation of the compatibility matrix in the integrated force method
- A data envelopment analytic model for assessing the relative efficiency of the selling function
- GENCOL
- RELAX4
- Kestrel
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming
- A cutting plane algorithm for the windy postman problem
- Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
- Truss topology optimization including unilateral contact
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
- Algorithm 347
- New descent rules for solving the linear semi-infinite programming problem
- Optimal solutions for the cutting stock problem
- Intelligent gradient search in linear programming
- Models for petroleum field exploitation
- Optimal expansion of capacitated transshipment networks
- MODLER
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
- Identification of Pareto-efficient facets in data envelopment analysis
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- A tabu search method for the truck and trailer routing problem
- SLP-IOR: An interactive model management system for stochastic linear programs
- A reduced-gradient variant of Karmarkar's algorithm and null-space projections
- A new branching strategy for time constrained routing problems with application to backhauling
- A hybrid tabu-ascent algorithm for the linear bilevel programming problem
This page was built for software: XMP
