Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Andrade, Carlos E.
Miyazawa, Flávio K.
and
Resende, Mauricio G.C.
2013.
Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem.
p.
463.
Koch, Thorsten
Martin, Alexander
and
Pfetsch, Marc E.
2013.
Facets of Combinatorial Optimization.
p.
483.
2014.
Adiabatic Quantum Computation and Quantum Annealing.
Bartz‐Beielstein, Thomas
Branke, Jürgen
Mehnen, Jörn
and
Mersmann, Olaf
2014.
Evolutionary Algorithms.
WIREs Data Mining and Knowledge Discovery,
Vol. 4,
Issue. 3,
p.
178.
Bentley, Jon
2014.
Experimental Algorithms.
Vol. 8504,
Issue. ,
p.
1.
Mniszewski, Susan M.
Junghans, Christoph
Voter, Arthur F.
Perez, Danny
and
Eidenbenz, Stephan J.
2015.
TADSim.
ACM Transactions on Modeling and Computer Simulation,
Vol. 25,
Issue. 3,
p.
1.
Huckridge, David A.
Ebert, Reinhard
Gruneisen, Mark T.
Dusek, Miloslav
Rarity, John G.
and
McGeoch, Catherine C.
2015.
Benchmarking D-Wave quantum annealing systems: some challenges.
Vol. 9648,
Issue. ,
p.
964815.
Usov, Ivan
and
Mezzenga, Raffaele
2015.
FiberApp: An Open-Source Software for Tracking and Analyzing Polymers, Filaments, Biomacromolecules, and Fibrous Objects.
Macromolecules,
Vol. 48,
Issue. 5,
p.
1269.
Usov, Ivan
Nyström, Gustav
Adamcik, Jozef
Handschin, Stephan
Schütz, Christina
Fall, Andreas
Bergström, Lennart
and
Mezzenga, Raffaele
2015.
Understanding nanocellulose chirality and structure–properties relationship at the single fibril level.
Nature Communications,
Vol. 6,
Issue. 1,
Alsina, Emanuel F.
Capodieci, Nicola
Cabri, Giacomo
and
Regattieri, Alberto
2015.
The Influence of the Picking Times of the Components in Time and Space Assembly Line Balancing Problems: An Approach with Evolutionary Algorithms.
p.
1021.
Papachristoudis, Dimitris G.
Halkidis, Spyros T.
and
Stephanides, George
2015.
An Experimental Comparison of Some LLL-Type Lattice Basis Reduction Algorithms.
International Journal of Applied and Computational Mathematics,
Vol. 1,
Issue. 3,
p.
327.
Vinci, Walter
and
Lidar, Daniel A.
2016.
Optimally Stopped Optimization.
Physical Review Applied,
Vol. 6,
Issue. 5,
Fischer, Andreas
and
de Meer, Hermann
2016.
Generating Virtual Network Embedding Problems With Guaranteed Solutions.
IEEE Transactions on Network and Service Management,
Vol. 13,
Issue. 3,
p.
504.
Gennari, Rosella
and
Vittorini, Pierpaolo
2016.
Qualitative Temporal Reasoning Can Improve on Temporal Annotation Quality: How and Why.
Applied Artificial Intelligence,
Vol. 30,
Issue. 7,
p.
690.
Pérez, Joaquín
Pazos, Rodolfo
Olivares, Víctor
Hidalgo, Miguel
Ruiz, Jorge
Martínez, Alicia
Almanza, Nelva
and
González, Moisés
2016.
Optimization of the K-means algorithm for the solution of high dimensional instances.
Vol. 1738,
Issue. ,
p.
310002.
Suh, Young‐Kyoon
Snodgrass, Richard T.
Kececioglu, John D.
Downey, Peter J.
Maier, Robert S.
and
Yi, Cheng
2017.
EMP: execution time measurement protocol for compute‐bound programs.
Software: Practice and Experience,
Vol. 47,
Issue. 4,
p.
559.
Clavijo, Leonardo Bermeo
and
Basilio, João C.
2017.
Empirical studies in the size of diagnosers and verifiers for diagnosability analysis.
Discrete Event Dynamic Systems,
Vol. 27,
Issue. 4,
p.
701.
Fischer, Andreas
2017.
Generating random service function chain embedding problems.
p.
1.
Nehéz, Martin
Bernát, Dušan
and
Lelovský, Marek
2017.
Estimation of the domination number in sparse random graphs and applications.
p.
1.
Job, Joshua
and
Lidar, Daniel
2018.
Test-driving 1000 qubits.
Quantum Science and Technology,
Vol. 3,
Issue. 3,
p.
030501.