Adiabatic Quantum Computing for the Subset Sum Problem: Preliminary Studies

Συγγραφείς: Freitas Bernardes, Cesar, Castellucci, Pedro, Gonçalves, Douglas, Duzzioni, Eduardo, Mucherino, Antonio

Συνεισφορές: Mucherino, Antonio

Θεματικοί όροι: Branch-and-prune algorithm, [INFO.INFO-ET] Computer Science [cs]/Emerging Technologies [cs.ET], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], D-Wave quantum annelear, Subset sum problem, [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph], Data representations

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://hal.science/hal-05164717v1

Adiabatic Quantum Computing for the Subset Sum Problem: Preliminary Studies

Συγγραφείς: Freitas Bernardes, Cesar, A, Castellucci, Pedro, Gonçalves, Douglas, Duzzioni, Eduardo, Mucherino, Antonio

Συνεισφορές: Universidade Federal de Santa Catarina = Federal University of Santa Catarina Florianópolis (UFSC), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT), ANR-24-CE23-1621,EVARISTE,Evolution d'arbres de recherche et d'heuristiques d'ordre pour les problèmes sous contraintes(2024)

Πηγή: Proceedings of the 20th Conference on Computer Science and Intelligence Systems FedCSIS 2025 (IEEE#66292) ; https://hal.science/hal-05164717 ; Proceedings of the 20th Conference on Computer Science and Intelligence Systems FedCSIS 2025 (IEEE#66292), Sep 2025, Krakaw, Poland ; https://2025.fedcsis.org/

Θεματικοί όροι: Subset sum problem, D-Wave quantum annelear, Data representations, Branch-and-prune algorithm, [INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph]

Θέμα γεωγραφικό: Krakaw, Poland

Διαθεσιμότητα: https://hal.science/hal-05164717
https://hal.science/hal-05164717v1/document
https://hal.science/hal-05164717v1/file/SSP_QUBO.pdf

Partial design space exploration strategies applied in preliminary design

Συγγραφείς: Thomas Richard de Latour, Raphaël Chenouard, Laurent Granvilliers

Συνεισφορές: Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-NANTES UNIVERSITÉ - École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ), Optimisation Globale et Résolution Ensembliste (LS2N - équipe OGRE), Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), ANR-19-CE10-0008,OSCAR,Démarche d'Optimisation pour des Systèmes Complexes Attractifs et duRables(2019)

Πηγή: International Journal on Interactive Design and Manufacturing (IJIDeM). 18:2291-2307

Θεματικοί όροι: [SPI]Engineering Sciences [physics], multi-objective optimization, numerical constraint satisfaction problem, Design space exploration numerical constraint satisfaction problem anytime branch-and-prune algorithm multi-objective optimization preliminary design, [INFO]Computer Science [cs], anytime branch-and-prune algorithm, Design space exploration, preliminary design

Robust Design Optimization of Permanent Magnet Linear Synchronous Motor Based on Quantified Constraint Satisfaction Problem

Συγγραφείς: Dong, F., Zhao, J., Song, J., Yao, Z.

Πηγή: IEEE Transactions on Energy Conversion IEEE Trans. Energy Convers. Energy Conversion, IEEE Transactions on. 35(4):2013-2024 Dec, 2020

Robust Parameter Estimation with Orthogonal Regression Using Interval Constraint Satisfaction Technique

Συγγραφείς: Raval, Sejal K.^Aff15, Raval, Kamlesh N.^Aff16, Makwana, Dipesh^Aff17, P. Kotak, Paresh^Aff18

Συνεισφορές: Kacprzyk, Janusz, Series Editor^Aff1, Gomide, Fernando, Advisory Editor^Aff2, Kaynak, Okyay, Advisory Editor^Aff3, Liu, Derong, Advisory Editor^Aff4, Pedrycz, Witold, Advisory Editor^Aff5, Polycarpou, Marios M., Advisory Editor^Aff6, Rudas, Imre J., Advisory Editor^Aff7, Wang, Jun, Advisory Editor^Aff8, Kahraman, Cengiz, editor^Aff9, Sari, Irem Ucal, editor^Aff10, Oztaysi, Basar, editor^Aff11, Cebi, Selcuk, editor^Aff12, Cevik Onar, Sezi, editor^Aff13, Tolga, A. Çağrı, editor^Aff14

Πηγή: Intelligent and Fuzzy Systems : Intelligence and Sustainable Future Proceedings of the INFUS 2023 Conference, Volume 2. 759:540-547

A double-decomposition based parallel exact algorithm for the feedback length minimization problem

Συγγραφείς: Zhen Shang, Jin-Kao Hao, Fei Ma

Πηγή: PeerJ Computer Science, Vol 9, p e1597 (2023)

Θεματικοί όροι: Product development, Design structure matrix, Parallel exact algorithm, Branch-and-prune algorithm, Electronic computers. Computer science, QA75.5-76.95

Περιγραφή αρχείου: electronic resource

Relation: https://peerj.com/articles/cs-1597.pdf; https://peerj.com/articles/cs-1597/; https://doaj.org/toc/2376-5992

Σύνδεσμος πρόσβασης: https://doaj.org/article/1b907d05457b48709c172f8807a0edef

Advances on the Geometric Algebra approach to the Discretizable Molecular Distance Geometry Problem (DMDGP)

Συγγραφείς: Alves, Rafael, de Souza, Cipriano, Lavor, Carlile

Πηγή: Proceedings of the 33rd Computer Graphics International. :85-88

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/2949035.2949057

Geometric Algebra to Model Uncertainties in the Discretizable Molecular Distance Geometry Problem

Συγγραφείς: Alves, Rafael, Lavor, Carlile

Πηγή: Advances in Applied Clifford Algebras. March 2017 27(1):439-452

Oriented Conformal Geometric Algebra and the Molecular Distance Geometry Problem

Συγγραφείς: Lavor, Carlile^{Aff1, cor1}, Alves, Rafael^{Aff2, cor2}

Πηγή: Advances in Applied Clifford Algebras. 29(1)

Optimal centers in branch-and-prune algorithms for univariate global optimization

Συγγραφείς: T. N. Grapsa, D. G. Sotiropoulos

Πηγή: Applied Mathematics and Computation. 169:247-277

Θεματικοί όροι: optimal centers, numerical examples, global optimization, 0211 other engineering and technologies, 02 engineering and technology, 01 natural sciences, Numerical mathematical programming methods, Nonlinear programming, Polyhedral combinatorics, branch-and-bound, branch-and-cut, branch-and-bound, branch-and-prune algorithm, 0101 mathematics, optimal mean value form, pruning steps

Περιγραφή αρχείου: application/xml

Scheduling projects with labor constraints

Συγγραφείς: Cavalcante, Cristina, Wolsey, Laurence, Carvalho De Souza, Cid, Savelsbergh, Martin, Wang, Yaoguang

Συνεισφορές: UCL - CORE - Center for Operations Research and Econometrics

Πηγή: Discrete Applied Mathematics. 112:27-52

Θεματικοί όροι: LP-based Ordering Heuristics, Labor Constraints, Deterministic scheduling theory in operations research, local search, Applied Mathematics, Tabu Search, Labor constraints, Integer programming, Project Scheduling, Search theory, labor constrained scheduling problem, LP-based ordering heuristics, Tabu search, Valid inequalities, tabu search algorithm, 8. Economic growth, Discrete Mathematics and Combinatorics, Project scheduling, linear relaxation, Valid Inequalities, branch-and-prune algorithm, integer programming, Integer Programming

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://dblp.uni-trier.de/db/journals/dam/dam112.html#CavalcanteSSWW01
https://doi.org/10.1016/S0166-218X(00)00308-5
https://www.sciencedirect.com/science/article/pii/S0166218X00003085
https://www2.isye.gatech.edu/people/faculty/Martin_Savelsbergh/publications/dam-submission.pdf
https://dial.uclouvain.be/pr/boreal/object/boreal:23555
https://hdl.handle.net/2078.1/3961

Progress in the Solving of a Circuit Design Problem: Progress in the solving of a circuit design problem

Συγγραφείς: Granvilliers, Laurent, Benhamou, Frédéric

Συνεισφορές: Lina, Contraintes, Laboratoire d'Informatique de Nantes Atlantique (LINA), Mines Nantes (Mines Nantes)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)

Πηγή: Journal of Global Optimization. 20:155-168

Θεματικοί όροι: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Numerical computation of solutions to systems of equations, Interval and finite arithmetic, constraint satisfaction, global branch-and-prune algorithm, interval Newton method, 0211 other engineering and technologies, 02 engineering and technology, automatic differentiation, 01 natural sciences, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], circuit design problem, Analytic circuit theory, 0101 mathematics, interval analysis

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://hal.science/hal-00444122v1
https://zbmath.org/1701643
https://doi.org/10.1023/a:1011266226870
https://link.springer.com/article/10.1023/A%3A1011266226870
https://hal.archives-ouvertes.fr/hal-00444122
https://dblp.uni-trier.de/db/journals/jgo/jgo20.html#GranvilliersB01

A Constraint Satisfaction Approach to a Circuit Design Problem: A constraint satisfaction approach to a circuit design problem

Συγγραφείς: Pascal Van Hentenryck, Jean-Francois Puget

Πηγή: Journal of Global Optimization. 13:75-93

Θεματικοί όροι: global zero search, circuit-design, Numerical computation of solutions to systems of equations, constraint satisfaction, 0211 other engineering and technologies, 02 engineering and technology, 01 natural sciences, Applications of mathematical programming, Nonlinear programming, transistor modelling, interval methods, electrical circuit, branch-and-prune algorithm, 0101 mathematics

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://cs.brown.edu/research/pubs/pdfs/1998/Puget-1998-CSA.pdf
https://link.springer.com/article/10.1023/A%3A1008236911603
https://dl.acm.org/doi/10.1023/A%3A1008236911603
https://dblp.uni-trier.de/db/journals/jgo/jgo13.html#PugetH98

Solving Polynomial Systems Using a Branch and Prune Approach: Solving polynomial systems using a branch and prune approach

Συγγραφείς: David McAllester, Pascal Van Hentenryck, Deepak Kapur

Πηγή: SIAM Journal on Numerical Analysis. 34:797-827

Θεματικοί όροι: branch and prune algorithm, continuation method, Numerical computation of solutions to systems of equations, Interval and finite arithmetic, 0202 electrical engineering, electronic engineering, information engineering, polynomial systems, 02 engineering and technology, interval arithmetic, global search method, 0101 mathematics, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://dl.acm.org/doi/10.1137/S0036142995281504
https://epubs.siam.org/doi/10.1137/S0036142995281504

An algorithm to enumerate all possible protein conformations verifying a set of distance constraints

Συγγραφείς: Cassioli, Andrea, Bardiaux, Benjamin, Bouvier, Guillaume, Mucherino, Antonio, Alves, Rafael, Liberti, Leo, Nilges, Michael, Lavor, Carlile, Malliavin, Thérèse E

Θεματικοί όροι: Distance geometry, Branch-and-prune algorithm, Molecular conformation, Protein structure, Nuclear magnetic resonance

Relation: http://www.biomedcentral.com/1471-2105/16/23

Διαθεσιμότητα: http://www.biomedcentral.com/1471-2105/16/23

An algorithm to enumerate all possible protein conformations verifying a set of distance constraints

Συγγραφείς: Cassioli, Andrea, Bardiaux, Benjamin, Bouvier, Guillaume, Mucherino, Antonio, Alves, Rafael, Liberti, Leo, Nilges, Michael, Lavor, Carlile, Malliavin, Thérèse E

Συνεισφορές: Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX), École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS), Bioinformatique structurale - Structural Bioinformatics, Institut Pasteur Paris (IP)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de Chimie et de Biochimie Pharmacologiques et Toxicologiques (LCBPT - UMR 8601), Université Paris Descartes - Paris 5 (UPD5)-Institut de Chimie - CNRS Chimie (INC-CNRS)-Centre National de la Recherche Scientifique (CNRS), Université de Rennes (UR), IBM T.J. Watson Research Center, Instituto de Matemática, Estatística e Computação Científica Brésil (IMECC), Universidade Estadual de Campinas = University of Campinas (UNICAMP), This work was funded by the European Union (FP7-IDEAS-ERC 294809 to MN), the “investissement d’avenir” program (grant bip:bip to MN and LL), and the Brazilian Research Agencies FAPESP and CN Pq (to CL and RA)., ANR-10-BINF-0003,Bip:Bip,Paradigme d'inference bayesienne pour la Biologie structurale in silico(2010), European Project: 294809,ERC-2011-ADG_20110310,ERC-2011-ADG_20110310,BayCellS(2012)

Πηγή: ISSN: 1471-2105 ; BMC Bioinformatics ; https://pasteur.hal.science/pasteur-01120652 ; BMC Bioinformatics, 2014, 16 (1), pp.23. ⟨10.1186/s12859-015-0451-1⟩.

Θεματικοί όροι: Nuclear Magnetic Resonance 1 2, Protein structure, Molecular conformation, branch-and-prune algorithm, Distance geometry, [SDV.BBM.BM]Life Sciences [q-bio]/Biochemistry, Molecular Biology/Molecular biology

Relation: info:eu-repo/semantics/altIdentifier/pmid/25627244; info:eu-repo/grantAgreement//294809/EU/A Bayesian Framework for Cellular Structural Biology/BayCellS; PUBMED: 25627244

Διαθεσιμότητα: https://pasteur.hal.science/pasteur-01120652
https://pasteur.hal.science/pasteur-01120652v1/document
https://pasteur.hal.science/pasteur-01120652v1/file/bipbip_7_rev_total.pdf
https://doi.org/10.1186/s12859-015-0451-1

A new framework for sharp and efficient resolution of NCSP with manifolds of solutions

Συγγραφείς: Goldsztejn, Alexandre, Granvilliers, Laurent

Πηγή: Constraints: An International Journal. April 2010 15(2):190-212

The Discretizable Molecular Distance Geometry Problem

Συγγραφείς: Carlile Lavor, Leo Liberti, Nelson Maculan

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://arxiv.org/pdf/q-bio/0608012v1.pdf.

Θεματικοί όροι: Molecular Distance Geometry Problem, Branch-and-Prune Algorithm

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.243.2357

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.243.2357
http://arxiv.org/pdf/q-bio/0608012v1.pdf

A Branch-and-Prune Algorithm for the Molecular Distance Geometry Problem

Συγγραφείς: Leo Liberti, Carlile Lavor, Nelson Maculan

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.lix.polytechnique.fr/~liberti/bpitor.pdf.

Θεματικοί όροι: molecular distance geometry problem, branch-and-prune algorithm

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.5065; http://www.lix.polytechnique.fr/~liberti/bpitor.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.5065
http://www.lix.polytechnique.fr/~liberti/bpitor.pdf

A Symbolic-Numerical Branch and Prune Algorithm for Solving Non-linear Polynomial Systems: A symbolic-numerical branch and prune algorithm for solving nonlinear polynomial systems

Συγγραφείς: Granvilliers,Laurent

Πηγή: JUCS-Journal of Universal Computer Science 4(2): 125-146

Θεματικοί όροι: branch and prune algorithm, Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.), constraint programming, cooperative constraint solvers, 02 engineering and technology, Branch and prune algorithm, non-linear constraint solving, 01 natural sciences, symbolic simplification, interval Newton methods, polynomial system, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, Groebner basis

Περιγραφή αρχείου: application/xml; text/html

Σύνδεσμος πρόσβασης: https://zbmath.org/1543278