XMP

swMATH36272MaRDI QIDQ51974

No author found.

Related Items (46)

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

This page was built for software: XMP