XMP

swMATH36272MaRDI QIDQ51974FDOQ51974

Author name not available (Why is that?)

Cited In (46)

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

This page was built for software: XMP