A surrogate-based heuristic for production planning problem of orders in small foundries

Cites work

A knapsack problem as a tool to solve the production planning problem in small foundries
A lot-sizing problem in an automated foundry
A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
A surrogate heuristic for set covering problems
A variable neighborhood search for multi-family capacitated lot-sizing problem
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
An approach for solving the lot-sizing problem of a market-driven foundry
An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
scientific article; zbMATH DE number 3614502 (Why is no real title available?)
scientific article; zbMATH DE number 1312984 (Why is no real title available?)
Integer Programming Algorithms: A Framework and State-of-the-Art Survey
Lagrangean/surrogate relaxation for generalized assignment problems
Lot sizing and furnace scheduling in small foundries
Polyhedral approaches to mixed integer linear programming
Surrogate Constraint Duality in Mathematical Programming
Surrogate constraint normalization for the set covering problem
Surrogate Dual Multiplier Search Procedures in Integer Programming
Surrogate Mathematical Programming
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
The production planning problem of orders in small foundries
Tutorial on surrogate constraint approaches for optimization in graphs
Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
Zero duality gap in surrogate constraint optimization: a concise review of models

This page was built for publication: A surrogate-based heuristic for production planning problem of orders in small foundries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551176)