Search results for "Multistart"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
72	Mirjam Dür, Charoenchai Khompatraporn, Zelda B. Zabinsky	Solving fractional problems with dynamic multistart improving hit-and-run.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Improving hit-and-run, Lipschitz properties, Multistart, Pure adaptive search, Global optimization, Stochastic algorithms, Fractional programming
72	Gintaras Palubeckis	Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem.	Ann. Oper. Res.	2004	DBLP DOI BibTeX RDF	binary quadratic optimization, multistart strategies, heuristics, tabu search
61	Lars W. Hagen, Andrew B. Kahng	Combining problem reduction and adaptive multistart: a new technique for superior iterative partitioning.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1997	DBLP DOI BibTeX RDF
43	Eraldo L. R. Fernandes, Celso C. Ribeiro	Using an Adaptive Memory Strategy to Improve a Multistart Heuristic for Sequencing by Hybridization.	WEA	2005	DBLP DOI BibTeX RDF
43	Elena Marchiori	Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem.	EvoWorkshops	2002	DBLP DOI BibTeX RDF
43	Melquíades Pérez Pérez, Francisco Almeida, J. Marcos Moreno-Vega	Genetic Algorithm with Multistart Search for the p-Hub Median Problem.	EUROMICRO	1998	DBLP DOI BibTeX RDF
36	Bruno Pinaud, Pascale Kuntz	On the influence of the instance structure on metaheuristic performances - application to a graph drawing problem.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
29	Andrea Grosso, Marco Locatelli 0001, Fabio Schoen	A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures.	Math. Program.	2007	DBLP DOI BibTeX RDF	Large scale global optimization, Multistart, Basin hopping, Population-based approaches, Molecular conformation problems
29	Il-Seok Oh, Jin-Seon Lee, Byung Ro Moon	Hybrid Genetic Algorithms for Feature Selection.	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF	sequential search algorithm, local search operation, multistart algorithm, Feature selection, hybrid genetic algorithm, atomic operation
25	Mattia Neroni, Angel A. Juan, Massimo Bertolini	A multistart biased-randomized algorithm for solving a three-dimensional case picking problem with real-life constraints.	Int. Trans. Oper. Res.	2024	DBLP DOI BibTeX RDF
25	Bencomo Domínguez-Martín, Inmaculada Rodríguez Martín, Juan José Salazar González	An efficient multistart heuristic for the driver and vehicle routing problem.	Comput. Oper. Res.	2023	DBLP DOI BibTeX RDF
25	Seyed Mahdi Homayouni, Dalila B. M. M. Fontes, José Fernando Gonçalves	A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation.	Int. Trans. Oper. Res.	2023	DBLP DOI BibTeX RDF
25	Ioannis G. Tsoulos, Evangelos Karvounis, Alexandros T. Tzallas	A Novel Sampling Technique for Multistart-Based Methods.	SN Comput. Sci.	2021	DBLP DOI BibTeX RDF
25	Sergio Cavero, Eduardo G. Pardo, Manuel Laguna, Abraham Duarte	Multistart search for the Cyclic Cutwidth Minimization Problem.	Comput. Oper. Res.	2021	DBLP DOI BibTeX RDF
25	Antanas Zilinskas, Jonathan Gillard 0002, Megan Scammell, Anatoly Zhigljavsky	Multistart with early termination of descents.	J. Glob. Optim.	2021	DBLP DOI BibTeX RDF
25	Zequn Wei, Jin-Kao Hao	Multistart solution-based tabu search for the Set-Union Knapsack Problem.	Appl. Soft Comput.	2021	DBLP DOI BibTeX RDF
25	Rubén Armañanzas, Adrián Díaz, Mario Martínez-García, Santiago Mazuelas	Derivation of a Cost-Sensitive COVID-19 Mortality Risk Indicator Using a Multistart Framework.	BIBM	2021	DBLP DOI BibTeX RDF
25	Alexander Yu. Gornov, Tatiana S. Zarodnyuk, Anton S. Anikin, Evgeniya A. Finkelstein	Extension technology and extrema selections in a stochastic multistart algorithm for optimal control problems.	J. Glob. Optim.	2020	DBLP DOI BibTeX RDF
25	Yongji Jia, Yuanyuan Xu, Dong Yang, Jia Li 0038	The Biobjective Bike-Sharing Rebalancing Problem with Balance Intervals: A Multistart Multiobjective Particle Swarm Optimization Algorithm.	Complex.	2020	DBLP DOI BibTeX RDF
25	Ruslan Shaydulin, Ilya Safro, Jeffrey Larson 0001	Multistart Methods for Quantum Approximate optimization.	HPEC	2019	DBLP DOI BibTeX RDF
25	Galyna Shcherbakova, Svitlana Antoshchuk, Anatoly Sachenko, Maksym Gerganov, Marina Polyakova, Victor Krylov	Areal Multistart Method of Optimization for Image Recognition.	DSMP	2018	DBLP DOI BibTeX RDF
25	Saul Toscano-Palmerin, Peter I. Frazier	Effort Allocation and Statistical Inference for 1-dimensional Multistart stochastic Gradient Descent.	WSC	2018	DBLP DOI BibTeX RDF
25	Alex Gliesch, Marcus Ritt, Mayron César O. Moreira	A Multistart Alternating Tabu Search for Commercial Districting.	EvoCOP	2018	DBLP DOI BibTeX RDF
25	Alfonso Mateos, Faustino Tello, Antonio Jiménez-Martín, Juan A. Fernández de Pozo	The ATC Work Shift Scheduling Problem Based on Multistart Simulated Annealing and Regular Expressions.	CoDIT	2018	DBLP DOI BibTeX RDF
25	Nicolas Boria, Sébastien Bougleux, Luc Brun	Approximating GED Using a Stochastic Generator and Multistart IPFP.	S+SSPR	2018	DBLP DOI BibTeX RDF
25	Simona Mancini	A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times.	Comput. Oper. Res.	2017	DBLP DOI BibTeX RDF
25	Tipaluck Krityakierne, Christine A. Shoemaker	SOMS: SurrOgate MultiStart algorithm for use with nonlinear programming for global optimization.	Int. Trans. Oper. Res.	2017	DBLP DOI BibTeX RDF
25	David Mignon, Thomas Simonson	Comparing three stochastic search algorithms for computational protein design: Monte Carlo, replica exchange Monte Carlo, and a multistart, steepest-descent heuristic.	J. Comput. Chem.	2016	DBLP DOI BibTeX RDF
25	Tansel Dökeroglu, Ahmet Cosar	A novel multistart hyper-heuristic algorithm on the grid for the quadratic assignment problem.	Eng. Appl. Artif. Intell.	2016	DBLP DOI BibTeX RDF
25	Humberto Rocha, Joana Matos Dias, Tiago Ventura, Brigida Costa Ferreira, Maria do Carmo Lopes	An Accelerated Multistart Derivative-Free Framework for the Beam Angle Optimization Problem in IMRT.	ICCSA (1)	2016	DBLP DOI BibTeX RDF
25	Florbela P. Fernandes, M. Fernanda P. Costa, Ana Maria A. C. Rocha, Edite M. G. P. Fernandes	Improving Efficiency of a Multistart with Interrupted Hooke-and-Jeeves Filter Search for Solving MINLP Problems.	ICCSA (1)	2016	DBLP DOI BibTeX RDF
25	Juan Carlos Rivera, Hasan Murat Afsar, Christian Prins	A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem.	Comput. Optim. Appl.	2015	DBLP DOI BibTeX RDF
25	Liuxi Qian, Zhaori Bi, Dian Zhou, Xuan Zeng 0001	Automated Technology Migration Methodology for Mixed-Signal Circuit Based on Multistart Optimization Framework.	IEEE Trans. Very Large Scale Integr. Syst.	2015	DBLP DOI BibTeX RDF
25	László Pál, Tibor Csendes	An improved stochastic local search method in a multistart framework.	SACI	2015	DBLP DOI BibTeX RDF
25	Omar Abdelkafi, Lhassane Idoumghar, Julien Lepagnot	Distributed Multistart Hybrid Iterative Tabu Search.	SMC	2015	DBLP DOI BibTeX RDF
25	Charles R. King, Dan E. Tamir, Mark McKenney	Improving Combinatorial Optimization Algorithms through Record Keeping in Constructive Multistart Search.	Int. J. Intell. Syst.	2014	DBLP DOI BibTeX RDF
25	Hime A. Oliveira Jr., Antonio Petraglia	Establishing Nash equilibria of strategic games: a multistart Fuzzy Adaptive Simulated Annealing approach.	Appl. Soft Comput.	2014	DBLP DOI BibTeX RDF
25	Xiangjing Lai, Zhipeng Lü	Multistart Iterated Tabu Search for Bandwidth Coloring Problem.	Comput. Oper. Res.	2013	DBLP DOI BibTeX RDF
25	Michal Czapinski	An effective Parallel Multistart Tabu Search for Quadratic Assignment Problem on CUDA platform.	J. Parallel Distributed Comput.	2013	DBLP DOI BibTeX RDF
25	Rommel G. Regis, Christine A. Shoemaker	A quasi-multistart framework for global optimization of expensive functions using response surface models.	J. Glob. Optim.	2013	DBLP DOI BibTeX RDF
25	Qinghua Wu 0002, Jin-Kao Hao	An adaptive multistart tabu search approach to solve the maximum clique problem.	J. Comb. Optim.	2013	DBLP DOI BibTeX RDF
25	László Pál	Comparison of multistart global optimization algorithms on the BBOB noiseless testbed.	GECCO (Companion)	2013	DBLP DOI BibTeX RDF
25	Florbela P. Fernandes, M. Fernanda P. Costa, Edite M. G. P. Fernandes	Multilocal Programming: A Derivative-Free Filter Multistart Algorithm.	ICCSA (1)	2013	DBLP DOI BibTeX RDF
25	Juan Carlos Rivera, Hasan Murat Afsar, Christian Prins	Multistart Evolutionary Local Search for a Disaster Relief Problem.	Artificial Evolution	2013	DBLP DOI BibTeX RDF
25	Xiangyong Li, Stephen C. H. Leung, Peng Tian	A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem.	Expert Syst. Appl.	2012	DBLP DOI BibTeX RDF
25	Jiunn-Chin Wang	A Multistart Simulated Annealing Algorithm for the Quadratic Assignment Problem.	IBICA	2012	DBLP DOI BibTeX RDF
25	Florbela P. Fernandes, M. Fernanda P. Costa, Edite M. G. P. Fernandes	A Derivative-Free Filter Driven Multistart Technique for Global Optimization.	ICCSA (3)	2012	DBLP DOI BibTeX RDF
25	Renato De Leone, Paola Festa, Emilia Marchitto	Solving a bus driver scheduling problem with randomized multistart heuristics.	Int. Trans. Oper. Res.	2011	DBLP DOI BibTeX RDF
25	Daniel Aloise, Celso C. Ribeiro	Adaptive memory in multistart heuristics for multicommodity network design.	J. Heuristics	2011	DBLP DOI BibTeX RDF
25	Valentina Cacchiani, Albert Einstein Fernandes Muritiba, Marcos Negreiros, Paolo Toth	A multistart heuristic for the equality generalized traveling salesman problem.	Networks	2011	DBLP DOI BibTeX RDF
25	Dusan Sovilj	Multistart Strategy Using Delta Test for Variable Selection.	ICANN (2)	2011	DBLP DOI BibTeX RDF
25	Constantinos Voglis, Isaac E. Lagaris	Towards "Ideal Multistart". A stochastic approach for locating the minima of a continuous function inside a bounded domain.	Appl. Math. Comput.	2009	DBLP DOI BibTeX RDF
25	Tabitha L. James, César Rego, Fred W. Glover	Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem.	IEEE Trans. Syst. Man Cybern. Part A	2009	DBLP DOI BibTeX RDF
25	Lin-Yu Tseng, Chih-Sheng Wu	The Multistart Drop-Add-Swap Heuristic for the Uncapacitated Facility Location Problem.	ICINCO-ICSO	2009	DBLP BibTeX RDF
25	Fernando C. Gomes, Cláudio Nogueira de Meneses, Panos M. Pardalos, Gerardo Valdisio R. Viana	A parallel multistart algorithm for the closest string problem.	Comput. Oper. Res.	2008	DBLP DOI BibTeX RDF
25	Leon S. Lasdon, John C. Plummer	Multistart algorithms for seeking feasibility.	Comput. Oper. Res.	2008	DBLP DOI BibTeX RDF
25	Zsolt Ugray, Leon S. Lasdon, John C. Plummer, Fred W. Glover, James P. Kelly, Rafael Martí	Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization.	INFORMS J. Comput.	2007	DBLP DOI BibTeX RDF
25	Mauricio G. C. Resende, Renato Fonseca F. Werneck	A hybrid multistart heuristic for the uncapacitated facility location problem.	Eur. J. Oper. Res.	2006	DBLP DOI BibTeX RDF
25	Eraldo L. R. Fernandes, Celso C. Ribeiro	A multistart constructive heuristic for sequencing by hybridization using adaptive memory.	Electron. Notes Discret. Math.	2005	DBLP DOI BibTeX RDF
25	Mauro Brunato, Roberto Battiti	A Multistart Randomized Greedy Algorithm for Traffic Grooming on Mesh Logical Topologies.	ONDM	2002	DBLP BibTeX RDF
25	Charles Fleurent, Fred W. Glover	Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory.	INFORMS J. Comput.	1999	DBLP DOI BibTeX RDF
25	William E. Hart	Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search.	SIAM J. Optim.	1998	DBLP DOI BibTeX RDF
25	Limin He, Elijah Polak	Multistart method with estimation scheme for global satisfycing problems.	J. Glob. Optim.	1993	DBLP DOI BibTeX RDF
25	Bruno Betrò, Fabio Schoen	Optimal and sub-optimal stopping rules for the Multistart algorithm in global optimization.	Math. Program.	1992	DBLP DOI BibTeX RDF
25	Bruno Betrò, Fabio Schoen	Sequential stopping rules for the multistart algorithm in global optimisation.	Math. Program.	1987	DBLP DOI BibTeX RDF
25	C. G. E. Boender, A. H. G. Rinnooy Kan	Bayesian stopping rules for multistart global optimization methods.	Math. Program.	1987	DBLP DOI BibTeX RDF
18	Massimiliano Caramia, Antonino Sgalambro	A fast heuristic algorithm for the maximum concurrent k-splittable flow problem.	Optim. Lett.	2010	DBLP DOI BibTeX RDF	k-Splittable flow, Maximum concurrent flow, Multicommodity, Heuristic, Throughput
18	Jernej Olensek, Árpád Bürmen, Janez Puhan, Tadej Tuma	DESA: a new hybrid global optimization method and its application to analog integrated circuit sizing.	J. Glob. Optim.	2009	DBLP DOI BibTeX RDF	Analog integrated circuit sizing, Optimization, Simulated annealing, Differential evolution
18	Nikolaus Hansen	Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	evolutionary computation, benchmarking, black-box optimization, CMA-ES
18	Raymond Ros	Benchmarking sep-CMA-ES on the BBOB-2009 noisy testbed.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	evolutionary computation, benchmarking, evolution strategy, black-box optimization, covariance matrix adaptation
18	Raymond Ros	Benchmarking the BFGS algorithm on the BBOB-2009 noisy testbed.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	BFGS, benchmarking, black-box optimization, quasi-newton
18	Raymond Ros	Benchmarking the NEWUOA on the BBOB-2009 function testbed.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	benchmarking, black-box optimization, derivative-free optimization
18	Raymond Ros	Benchmarking the BFGS algorithm on the BBOB-2009 function testbed.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	BFGS, benchmarking, black-box optimization, quasi-newton
18	Nikolaus Hansen	Benchmarking the nelder-mead downhill simplex algorithm with many local restarts.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	evolutionary computation, benchmarking, black-box optimization, direct search, CMA-ES
18	Raymond Ros	Benchmarking the NEWUOA on the BBOB-2009 noisy testbed.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	benchmarking, black-box optimization, derivative-free optimization
18	Petr Posik	BBOB-benchmarking the generalized generation gap model with parent centric crossover.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	generalized generation gap, parent centric crossover, evolutionary computation, benchmarking, black-box optimization
18	Nikolaus Hansen	Benchmarking a BI-population CMA-ES on the BBOB-2009 noisy testbed.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	evolutionary computation, benchmarking, black-box optimization, direct search, CMA-ES
18	Raymond Ros	Benchmarking sep-CMA-ES on the BBOB-2009 function testbed.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	evolutionary computation, benchmarking, evolution strategy, black-box optimization, covariance matrix adaptation
18	Tibor Csendes, László Pál, José-Oscar H. Sendín, Julio R. Banga	The GLOBAL optimization method revisited.	Optim. Lett.	2008	DBLP DOI BibTeX RDF	Numerical tests, Clustering, Global optimization, Direct methods
18	Véronique Bouffard, Jacques A. Ferland	Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem.	J. Sched.	2007	DBLP DOI BibTeX RDF	Simulated annealing, Tabu search, Variable neighborhood search, Diversification, Threshold accepting, Resource-constrained scheduling
18	Denise Sato Yamashita, Vinícius Amaral Armentano, Manuel Laguna	Robust optimization models for project scheduling with resource availability cost.	J. Sched.	2007	DBLP DOI BibTeX RDF	Resource availability cost, Robust optimization, Project scheduling, Scatter search
18	Kengo Katayama, Hiroshi Yamashita, Hiroyuki Narihisa	Variable depth search and iterated local search for the node placement problem in multihop WDM lightwave networks.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
18	Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende	GRASP with path relinking for the weighted MAXSAT problem.	ACM J. Exp. Algorithmics	2006	DBLP DOI BibTeX RDF	time-to-target plots, performance, Algorithms, heuristics, experimentation, GRASP, path relinking
18	Anna Esparcia-Alcázar, Lidia Lluch-Revert, Manuel Cardós, Ken Sharman, Carlos Andrés-Romano	Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm.	EvoCOP	2006	DBLP DOI BibTeX RDF
18	Laurent Michel, Andrew See, Pascal Van Hentenryck	Distributed Constraint-Based Local Search.	CP	2006	DBLP DOI BibTeX RDF
18	Melquíades Pérez Pérez, Francisco Almeida, J. Marcos Moreno-Vega	A Hybrid GRASP-Path Relinking Algorithm for the Capacitated p-hub Median Problem.	Hybrid Metaheuristics	2005	DBLP DOI BibTeX RDF
18	Mauricio G. C. Resende, Renato Fonseca F. Werneck	A Hybrid Heuristic for the p-Median Problem.	J. Heuristics	2004	DBLP DOI BibTeX RDF	local search, metaheuristics, GRASP, path-relinking, p-median, hybrid heuristic
18	Haipeng Guo, Prashanth R. Boddhireddy, William H. Hsu	An ACO Algorithm for the Most Probable Explanation Problem.	Australian Conference on Artificial Intelligence	2004	DBLP DOI BibTeX RDF
18	Yong-In Yoon, Jang-Whan Im, Dae-Hyun Kim, Jong-Soo Choi, Jeong-Su Oh	Reconstruction of Linearly Parameterized Models from a Single Image Using the Vanishing Points.	SCIA	2003	DBLP DOI BibTeX RDF
18	David Jelinek, Camillo J. Taylor	Reconstruction of Linearly Parameterized Models from Single Images with a Camera of Unknown Focal Length.	IEEE Trans. Pattern Anal. Mach. Intell.	2001	DBLP DOI BibTeX RDF	uncalibrated imagery, 3D reconstruction, numerical optimization
18	Steffen Iredi, Daniel Merkle, Martin Middendorf	Bi-Criterion Optimization with Multi Colony Ant Algorithms.	EMO	2001	DBLP DOI BibTeX RDF
18	Yizong Cheng	Mean Shift, Mode Seeking, and Clustering.	IEEE Trans. Pattern Anal. Mach. Intell.	1995	DBLP DOI BibTeX RDF	global optimization, cluster analysis, Hough transform, k-means clustering, Mean shift, gradient descent