scientific article; zbMATH DE number 3573593
From MaRDI portal
Publication:4145425
Cited in
(24)- Hybrid approach to the rational management of machine replacement
- A direct dual method for the mixed plant location problem with some side constraints
- A dual algorithm for the one-machine scheduling problem
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- 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
- A new storage reduction technique for the solution of the group problem
- Subgradient optimization applied to a discrete nonlinear problem in engineering design
- Efficient group cuts for integer programs
- The traveling salesman problem: A duality approach
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- Surrogate duality relaxation for job shop scheduling
- Optimal set partitioning, matchings and lagrangian duality
- Lagrangian dual ascent by generalized linear programming
- A facet generation and relaxation technique applied to an assignment problem with side constraints
- Deterministic job-shop scheduling: Past, present and future
- A heuristic decomposition approach to optimal control in a water supply model
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- Lagrangean relaxation. (With comments and rejoinder).
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- Primal-dual approach to the single level capacitated lot-sizing problem
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
- Cross decomposition for mixed integer programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4145425)