A hybrid primal heuristic for finding feasible solutions to mixed integer programs-Reference-Cited by-同舟云学术

A hybrid primal heuristic for finding feasible solutions to mixed integer programs

Published:2017-11 Issue:1 Volume:263 Page:62-71
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Andrade Carlos E.^ORCID,Ahmed Shabbir,Nemhauser George L.,Shao Yufen

Funder

AFOSR

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference25 articles.

1. Improving the feasibility pump;Achterberg;Discrete Optimization,2007

2. Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem;Andrade,2013

3. Evolutionary algorithms for overlapping correlation clustering;Andrade,2014

4. A biased random-key genetic algorithm for wireless backhaul network design;Andrade;Applied Soft Computing,2015

5. Biased random-key genetic algorithms for the winner determination problem in combinatorial auctions;Andrade;Evolutionary Computation,2015

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Biased random-key genetic algorithm for the job sequencing and tool switching problem with non-identical parallel machines;Computers & Operations Research;2024-03

2. Biased random-key genetic algorithms: A review;European Journal of Operational Research;2024-03

3. Additional Research Lines Concerning CMSA;Computational Intelligence Methods and Applications;2024

4. A heuristic method to find a quick feasible solution based on the ratio programming;Operational Research;2023-06-11

5. Generalized Relax-and-Fix heuristic;Computers & Operations Research;2023-01