scientific article; zbMATH DE number 3550466
From MaRDI portal
Publication:4124605
Cited in
(18)- Feasibility pump 2.0
- A branch-and-bound algorithm for 0-1 parametric mixed integer programming
- A reference direction approach to multiple objective integer linear programming
- An interior point algorithm to solve computationally difficult set covering problems
- Cutting-plane theory: Algebraic methods
- An interactive procedure for multiple objective integer linear programming problems
- The multidimensional 0-1 knapsack problem: an overview.
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Heuristic methods and applications: A categorized survey
- Repairing MIP infeasibility through local branching
- A feasibility pump heuristic for general mixed-integer problems
- A path relinking approach with ejection chains for the generalized assignment problem
- The feasibility pump
- Experimental results on Hillier's linear search
- Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick)
- A computational study of parametric tabu search for 0-1 mixed integer programs
- Large-scale mixed integer programming: Benders-type heuristics
- An algorithm of internal feasible directions for linear 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 Q4124605)
