Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/heuristics/heuristics7.bht:"
download as .bib file
@article{DBLP:journals/heuristics/BabayevB01,
author = {Djangir A. Babayev and
George I. Bell},
title = {An Optimization Problem with a Separable Non-Convex Objective Function
and a Linear Constraint},
journal = {J. Heuristics},
volume = {7},
number = {2},
pages = {169--184},
year = {2001},
url = {https://doi.org/10.1023/A:1009661804163},
doi = {10.1023/A:1009661804163},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/BabayevB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/Cantu-Paz01,
author = {Erick Cant{\'{u}}{-}Paz},
title = {Migration Policies, Selection Pressure, and Parallel Evolutionary
Algorithms},
journal = {J. Heuristics},
volume = {7},
number = {4},
pages = {311--334},
year = {2001},
url = {https://doi.org/10.1023/A:1011375326814},
doi = {10.1023/A:1011375326814},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/Cantu-Paz01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/CordoneC01,
author = {Roberto Cordone and
Roberto Wolfler Calvo},
title = {A Heuristic for the Vehicle Routing Problem with Time Windows},
journal = {J. Heuristics},
volume = {7},
number = {2},
pages = {107--129},
year = {2001},
url = {https://doi.org/10.1023/A:1011301019184},
doi = {10.1023/A:1011301019184},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/CordoneC01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/CoyGRW01,
author = {Steven P. Coy and
Bruce L. Golden and
George C. Runger and
Edward A. Wasil},
title = {Using Experimental Design to Find Effective Parameter Settings for
Heuristics},
journal = {J. Heuristics},
volume = {7},
number = {1},
pages = {77--97},
year = {2001},
url = {https://doi.org/10.1023/A:1026569813391},
doi = {10.1023/A:1026569813391},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/CoyGRW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/DepuySAM01,
author = {Gail W. DePuy and
Martin W. P. Savelsbergh and
Jane C. Ammons and
Leon F. McGinnis},
title = {An Integer Programming Heuristic for Component Allocation in Printed
Circuit Card Assembly Systems},
journal = {J. Heuristics},
volume = {7},
number = {4},
pages = {351--369},
year = {2001},
url = {https://doi.org/10.1023/A:1011388227723},
doi = {10.1023/A:1011388227723},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/DepuySAM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/FerlandBNAMGG01,
author = {Jacques A. Ferland and
Ilham Berrada and
Imene Nabli and
B. Ahiod and
Philippe Michelon and
Viviane Gascon and
{\'{E}}ric Gagn{\'{e}}},
title = {Generalized Assignment Type Goal Programming Problem: Application
to Nurse Scheduling},
journal = {J. Heuristics},
volume = {7},
number = {4},
pages = {391--413},
year = {2001},
url = {https://doi.org/10.1023/A:1011392328632},
doi = {10.1023/A:1011392328632},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/heuristics/FerlandBNAMGG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/FrenchRW01,
author = {Alan P. French and
Andrew C. Robinson and
John M. Wilson},
title = {Using a Hybrid Genetic-Algorithm/Branch and Bound Approach to Solve
Feasibility and Optimization Integer Programming Problems},
journal = {J. Heuristics},
volume = {7},
number = {6},
pages = {551--564},
year = {2001},
url = {https://doi.org/10.1023/A:1011921025322},
doi = {10.1023/A:1011921025322},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/FrenchRW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/GreistorferK01,
author = {Peter Greistorfer and
Hans Kellerer},
title = {Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem},
journal = {J. Heuristics},
volume = {7},
number = {4},
pages = {371--390},
year = {2001},
url = {https://doi.org/10.1023/A:1011340311793},
doi = {10.1023/A:1011340311793},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/GreistorferK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/GulliverO01,
author = {T. Aaron Gulliver and
Patric R. J. {\"{O}}sterg{\aa}rd},
title = {Improved Bounds for Ternary Linear Codes of Dimension 8 Using Tabu
Search},
journal = {J. Heuristics},
volume = {7},
number = {1},
pages = {37--46},
year = {2001},
url = {https://doi.org/10.1023/A:1026513628412},
doi = {10.1023/A:1026513628412},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/GulliverO01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/HammerR01,
author = {Peter L. Hammer and
David J. Rader Jr.},
title = {Maximally Disjoint Solutions of the Set Covering Problem},
journal = {J. Heuristics},
volume = {7},
number = {2},
pages = {131--144},
year = {2001},
url = {https://doi.org/10.1023/A:1009687403254},
doi = {10.1023/A:1009687403254},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/HammerR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/Hanafi01,
author = {Sa{\"{\i}}d Hanafi},
title = {On the Convergence of Tabu Search},
journal = {J. Heuristics},
volume = {7},
number = {1},
pages = {47--58},
year = {2001},
url = {https://doi.org/10.1023/A:1026565712483},
doi = {10.1023/A:1026565712483},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/Hanafi01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/HansenMP01,
author = {Pierre Hansen and
Nenad Mladenovic and
Dionisio P{\'{e}}rez{-}Brito},
title = {Variable Neighborhood Decomposition Search},
journal = {J. Heuristics},
volume = {7},
number = {4},
pages = {335--350},
year = {2001},
url = {https://doi.org/10.1023/A:1011336210885},
doi = {10.1023/A:1011336210885},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/HansenMP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/HelgasonKL01,
author = {Richard V. Helgason and
Jeffery L. Kennington and
Karen R. Lewis},
title = {Cruise Missile Mission Planning: {A} Heuristic Algorithm for Automatic
Path Generation},
journal = {J. Heuristics},
volume = {7},
number = {5},
pages = {473--494},
year = {2001},
url = {https://doi.org/10.1023/A:1011325912346},
doi = {10.1023/A:1011325912346},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/HelgasonKL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/IlichS01,
author = {Nesa Ilich and
Slobodan P. Simonovic},
title = {An Evolution Program for Non-Linear Transportation Problems},
journal = {J. Heuristics},
volume = {7},
number = {2},
pages = {145--168},
year = {2001},
url = {https://doi.org/10.1023/A:1009609820093},
doi = {10.1023/A:1009609820093},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/IlichS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/IllesP01,
author = {Tibor Ill{\'{e}}s and
David Pisinger},
title = {Upper Bounds on the Covering Number of Galois-Planes with Small Order},
journal = {J. Heuristics},
volume = {7},
number = {1},
pages = {59--76},
year = {2001},
url = {https://doi.org/10.1023/A:1026517829321},
doi = {10.1023/A:1026517829321},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/IllesP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/JagotaS01,
author = {Arun Jagota and
Laura A. Sanchis},
title = {Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique},
journal = {J. Heuristics},
volume = {7},
number = {6},
pages = {565--585},
year = {2001},
url = {https://doi.org/10.1023/A:1011925109392},
doi = {10.1023/A:1011925109392},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/JagotaS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/JelasityOG01,
author = {M{\'{a}}rk Jelasity and
Pilar Mart{\'{\i}}nez Ortigosa and
Inmaculada Garc{\'{\i}}a},
title = {UEGO, an Abstract Clustering Technique for Multimodal Global Optimization},
journal = {J. Heuristics},
volume = {7},
number = {3},
pages = {215--233},
year = {2001},
url = {https://doi.org/10.1023/A:1011367930251},
doi = {10.1023/A:1011367930251},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/JelasityOG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/KrishnamoorthyES01,
author = {Mohan Krishnamoorthy and
Andreas T. Ernst and
Yazid M. Sharaiha},
title = {Comparison of Algorithms for the Degree Constrained Minimum Spanning
Tree},
journal = {J. Heuristics},
volume = {7},
number = {6},
pages = {587--611},
year = {2001},
url = {https://doi.org/10.1023/A:1011977126230},
doi = {10.1023/A:1011977126230},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/KrishnamoorthyES01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/RardinU01,
author = {Ronald L. Rardin and
Reha Uzsoy},
title = {Experimental Evaluation of Heuristic Optimization Algorithms: {A}
Tutorial},
journal = {J. Heuristics},
volume = {7},
number = {3},
pages = {261--304},
year = {2001},
url = {https://doi.org/10.1023/A:1011319115230},
doi = {10.1023/A:1011319115230},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/RardinU01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/Saab01,
author = {Youssef Saab},
title = {A Fast and Effective Algorithm for the Feedback Arc Set Problem},
journal = {J. Heuristics},
volume = {7},
number = {3},
pages = {235--250},
year = {2001},
url = {https://doi.org/10.1023/A:1011315014322},
doi = {10.1023/A:1011315014322},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/Saab01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/SalehD01,
author = {Hussain Aziz Saleh and
Peter Dare},
title = {Effective Heuristics for the {GPS} Survey Network of Malta: Simulated
Annealing and Tabu Search Techniques},
journal = {J. Heuristics},
volume = {7},
number = {6},
pages = {533--549},
year = {2001},
url = {https://doi.org/10.1023/A:1011968924413},
doi = {10.1023/A:1011968924413},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/SalehD01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/SimhaCS01,
author = {Rahul Simha and
Weidong Cai and
Valentin I. Spitkovsky},
title = {Simulated N-Body: New Particle Physics-Based Heuristics for a Euclidean
Location-Allocation Problem},
journal = {J. Heuristics},
volume = {7},
number = {1},
pages = {23--36},
year = {2001},
url = {https://doi.org/10.1023/A:1026561511574},
doi = {10.1023/A:1026561511574},
timestamp = {Thu, 22 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/SimhaCS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/Sourd01,
author = {Francis Sourd},
title = {Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement
Procedures},
journal = {J. Heuristics},
volume = {7},
number = {6},
pages = {519--531},
year = {2001},
url = {https://doi.org/10.1023/A:1011960407575},
doi = {10.1023/A:1011960407575},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/Sourd01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/Valenzuela01,
author = {Christine L. Valenzuela},
title = {A Study of Permutation Operators for Minimum Span Frequency Assignment
Using an Order Based Representation},
journal = {J. Heuristics},
volume = {7},
number = {1},
pages = {5--21},
year = {2001},
url = {https://doi.org/10.1023/A:1026597127504},
doi = {10.1023/A:1026597127504},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/Valenzuela01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/VasquezH01,
author = {Michel Vasquez and
Jin{-}Kao Hao},
title = {A Heuristic Approach for Antenna Positioning in Cellular Networks},
journal = {J. Heuristics},
volume = {7},
number = {5},
pages = {443--472},
year = {2001},
url = {https://doi.org/10.1023/A:1011373828276},
doi = {10.1023/A:1011373828276},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/VasquezH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/Wright01,
author = {Mike Wright},
title = {Subcost-Guided Search-Experiments with Timetabling Problems},
journal = {J. Heuristics},
volume = {7},
number = {3},
pages = {251--260},
year = {2001},
url = {https://doi.org/10.1023/A:1011367031160},
doi = {10.1023/A:1011367031160},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/Wright01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/XuC01,
author = {Jiyang Xu and
Steve Y. Chiu},
title = {Effective Heuristic Procedures for a Field Technician Scheduling Problem},
journal = {J. Heuristics},
volume = {7},
number = {5},
pages = {495--509},
year = {2001},
url = {https://doi.org/10.1023/A:1011377929184},
doi = {10.1023/A:1011377929184},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/XuC01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/YagiuraI01,
author = {Mutsunori Yagiura and
Toshihide Ibaraki},
title = {Efficient 2 and 3-Flip Neighborhood Search Algorithms for the {MAX}
{SAT:} Experimental Evaluation},
journal = {J. Heuristics},
volume = {7},
number = {5},
pages = {423--442},
year = {2001},
url = {https://doi.org/10.1023/A:1011306011437},
doi = {10.1023/A:1011306011437},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/YagiuraI01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/ZhangHS01,
author = {Rachel Q. Zhang and
Wallace J. Hopp and
Chonawee Supatgiat},
title = {Spreadsheet Implementable Inventory Control for a Distribution Center},
journal = {J. Heuristics},
volume = {7},
number = {2},
pages = {185--203},
year = {2001},
url = {https://doi.org/10.1023/A:1009613921001},
doi = {10.1023/A:1009613921001},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/ZhangHS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-30 14:22 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
