Pages that link to "Item:Q1609922"

The following pages link to Solving zero-one mixed integer programming problems using tabu search (Q1609922):

Displaying 33 items.

• Effect of solution representations on tabu search in scheduling applications (Q336636) (← links)
• Boosting the feasibility pump (Q495939) (← links)
• Shift-and-propagate (Q524884) (← links)
• An interior point cutting plane heuristic for mixed integer programming (Q632679) (← links)
• Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
• A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
• RENS. The optimal rounding (Q744216) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• Metaheuristics in combinatorial optimization (Q817206) (← links)
• Feasibility pump 2.0 (Q1043854) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• An efficient linearization approach for mixed-integer problems (Q1572989) (← links)
• A linearization method for mixed 0--1 polynomial programs (Q1577382) (← links)
• Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819) (← links)
• MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
• A modified PSO algorithm for minimizing the total costs of resources in MRCPSP (Q1954712) (← links)
• Revenue maximization of Internet of things provider using variable neighbourhood search (Q2022217) (← links)
• On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs (Q2064299) (← links)
• Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
• A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays (Q2253379) (← links)
• Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
• A variable neighborhood decomposition search method for supply chain management planning problems (Q2433455) (← links)
• Repairing MIP infeasibility through local branching (Q2459381) (← links)
• A feasibility pump heuristic for general mixed-integer problems (Q2471275) (← links)
• Improving the feasibility pump (Q2471276) (← links)
• Variable neighborhood search and local branching (Q2489139) (← links)
• Adaptive memory search for multidemand multidimensional knapsack problems (Q2489302) (← links)
• Airfreight forwarder shipment planning: A mixed 0-1 model and managerial issues in the integration and consolidation of shipments (Q2519081) (← links)
• The feasibility pump (Q2571001) (← links)
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 (Q4546065) (← links)
• Multiple machine JIT scheduling: a tabu search approach (Q5428715) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• Feasibility jump: an LP-free Lagrangian MIP heuristic (Q6175707) (← links)