Pages that link to "Item:Q525062"

The following pages link to A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062):

Displaying 12 items.

• The green capacitated multi-item lot sizing problem with parallel machines (Q1651651) (← links)
• Mixed integer programming based heuristics for the patient admission scheduling problem (Q1652186) (← links)
• Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing (Q1725608) (← links)
• Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials (Q1737490) (← links)
• Generalized relax-and-fix heuristic (Q2108128) (← links)
• The multiphase course timetabling problem (Q2116932) (← links)
• Worst case analysis of relax and fix heuristics for lot-sizing problems (Q2312339) (← links)
• Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
• Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem (Q2676332) (← links)
• A kernel search heuristic for the multivehicle inventory routing problem (Q6092539) (← links)
• A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan (Q6092619) (← links)
• Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries (Q6164363) (← links)