scientific article; zbMATH DE number 3573593
From MaRDI portal
Publication:4145425
zbMath0367.90087MaRDI QIDQ4145425
Jeremy F. Shapiro, Marshall L. Fisher, William D. Northup
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Tabu search for nonlinear and parametric optimization (with links to genetic algorithms) ⋮ Lagrangean relaxation. (With comments and rejoinder). ⋮ Subgradient optimization applied to a discrete nonlinear problem in engineering design ⋮ A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem ⋮ Efficient group cuts for integer programs ⋮ A direct dual method for the mixed plant location problem with some side constraints ⋮ Lagrangian dual ascent by generalized linear programming ⋮ A heuristic decomposition approach to optimal control in a water supply model ⋮ Surrogate duality relaxation for job shop scheduling ⋮ Primal-dual approach to the single level capacitated lot-sizing problem ⋮ A dual algorithm for the one-machine scheduling problem ⋮ The traveling salesman problem: A duality approach ⋮ A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions ⋮ Four solution techniques for a general one machine scheduling problem. A comparative study ⋮ Matrix formulation of EISs of graphs and its application to WSN covering problems ⋮ Hybrid approach to the rational management of machine replacement ⋮ A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ Cross decomposition for mixed integer programming ⋮ A facet generation and relaxation technique applied to an assignment problem with side constraints ⋮ 'Multidimensional' extensions and a nested dual approach for the m-median problem ⋮ Optimal set partitioning, matchings and lagrangian duality ⋮ A new storage reduction technique for the solution of the group problem
This page was built for publication:
