The following pages link to (Q4124605):
Displaying 18 items.
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- Large-scale mixed integer programming: Benders-type heuristics (Q789322) (← links)
- An algorithm of internal feasible directions for linear integer programming (Q809890) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- A branch-and-bound algorithm for 0-1 parametric mixed integer programming (Q1061012) (← links)
- A reference direction approach to multiple objective integer linear programming (Q1130044) (← links)
- An interior point algorithm to solve computationally difficult set covering problems (Q1181917) (← links)
- Cutting-plane theory: Algebraic methods (Q1257827) (← links)
- An interactive procedure for multiple objective integer linear programming problems (Q1309911) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Repairing MIP infeasibility through local branching (Q2459381) (← links)
- A feasibility pump heuristic for general mixed-integer problems (Q2471275) (← links)
- A path relinking approach with ejection chains for the generalized assignment problem (Q2570155) (← links)
- The feasibility pump (Q2571001) (← links)
- Experimental results on Hillier's linear search (Q4074674) (← links)
- Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick) (Q4121710) (← links)
