Article cité par

La fonctionnalité Article cité par… liste les citations d'un article. Ces citations proviennent de la base de données des articles de EDP Sciences, ainsi que des bases de données d'autres éditeurs participant au programme CrossRef Cited-by Linking Program. Vous pouvez définir une alerte courriel pour être prévenu de la parution d'un nouvel article citant " cet article (voir sur la page du résumé de l'article le menu à droite).

Article cité :

Penalization-induced shrinking without rotation in high dimensional GLM regression: a cavity analysis

E Massa, M A Jonker and A C C Coolen
Journal of Physics A: Mathematical and Theoretical 55 (48) 485002 (2022)
https://doi.org/10.1088/1751-8121/aca4ab

A local interaction dynamic for the matching problem

Enrico Maria Fenoaltea, Izat B. Baybusinov, Xu Na and Yi-Cheng Zhang
Physica A: Statistical Mechanics and its Applications 604 127690 (2022)
https://doi.org/10.1016/j.physa.2022.127690

The Number of Optimal Matchings for Euclidean Assignment on the Line

Sergio Caracciolo, Vittorio Erba and Andrea Sportiello
Journal of Statistical Physics 183 (1) (2021)
https://doi.org/10.1007/s10955-021-02741-1

The Stable Marriage Problem: An interdisciplinary review from the physicist’s perspective

Enrico Maria Fenoaltea, Izat B. Baybusinov, Jianyang Zhao, Lei Zhou and Yi-Cheng Zhang
Physics Reports 917 1 (2021)
https://doi.org/10.1016/j.physrep.2021.03.001

Random-link matching problems on random regular graphs

Giorgio Parisi, Gianmarco Perrupato and Gabriele Sicuro
Journal of Statistical Mechanics: Theory and Experiment 2020 (3) 033301 (2020)
https://doi.org/10.1088/1742-5468/ab7127

Statistical mechanics of low-rank tensor decomposition

Jonathan Kadmon and Surya Ganguli
Journal of Statistical Mechanics: Theory and Experiment 2019 (12) 124016 (2019)
https://doi.org/10.1088/1742-5468/ab3216

Quantum Technology and Optimization Problems

Hirotaka Irie, Goragot Wongpaisarnsin, Masayoshi Terabe, Akira Miki and Shinichirou Taguchi
Lecture Notes in Computer Science, Quantum Technology and Optimization Problems 11413 145 (2019)
https://doi.org/10.1007/978-3-030-14082-3_13

Anomalous Scaling of the Optimal Cost in the One-Dimensional Random Assignment Problem

Sergio Caracciolo, Matteo D’Achille and Gabriele Sicuro
Journal of Statistical Physics 174 (4) 846 (2019)
https://doi.org/10.1007/s10955-018-2212-9

Constructing concrete hard instances of the maximum independent set problem

Naoto Shiraishi and Jun Takahashi
Journal of Statistical Mechanics: Theory and Experiment 2019 (11) 113401 (2019)
https://doi.org/10.1088/1742-5468/ab409d

Average optimal cost for the Euclidean TSP in one dimension

Sergio Caracciolo, Andrea Di Gioacchino, Enrico M Malatesta and Carlo Vanoni
Journal of Physics A: Mathematical and Theoretical 52 (26) 264003 (2019)
https://doi.org/10.1088/1751-8121/ab1600

Dynamic, distributed constraint solving and thermodynamic theory

Roger Mailler, Huimin Zheng and Anton Ridgway
Autonomous Agents and Multi-Agent Systems 32 (1) 188 (2018)
https://doi.org/10.1007/s10458-017-9377-5

Instability in Stable Marriage Problem: Matching Unequally Numbered Men and Women

Gui-Yuan Shi, Yi-Xiu Kong, Bo-Lun Chen, Guang-Hui Yuan, Rui-Jie Wu and Claudio Tessone
Complexity 2018 (1) (2018)
https://doi.org/10.1155/2018/7409397

Competition May Increase Social Utility in Bipartite Matching Problem

Yi-Xiu Kong, Guang-Hui Yuan, Lei Zhou, Rui-Jie Wu, Gui-Yuan Shi and Claudio Tessone
Complexity 2018 (1) (2018)
https://doi.org/10.1155/2018/4092056

Plastic number and possible optimal solutions for an Euclidean 2-matching in one dimension

Sergio Caracciolo, Andrea Di Gioacchino and Enrico M Malatesta
Journal of Statistical Mechanics: Theory and Experiment 2018 (8) 083402 (2018)
https://doi.org/10.1088/1742-5468/aad3f7

The random fractional matching problem

Carlo Lucibello, Enrico M Malatesta, Giorgio Parisi and Gabriele Sicuro
Journal of Statistical Mechanics: Theory and Experiment 2018 (5) 053301 (2018)
https://doi.org/10.1088/1742-5468/aabbc8

Does $\ell _{p}$ -Minimization Outperform $\ell _{1}$ -Minimization?

Le Zheng, Arian Maleki, Haolei Weng, Xiaodong Wang and Teng Long
IEEE Transactions on Information Theory 63 (11) 6896 (2017)
https://doi.org/10.1109/TIT.2017.2717585

Finite-size corrections in the random assignment problem

Sergio Caracciolo, Matteo P. D'Achille, Enrico M. Malatesta and Gabriele Sicuro
Physical Review E 95 (5) (2017)
https://doi.org/10.1103/PhysRevE.95.052129

Analysis of ground state in random bipartite matching

Gui-Yuan Shi, Yi-Xiu Kong, Hao Liao and Yi-Cheng Zhang
Physica A: Statistical Mechanics and its Applications 444 397 (2016)
https://doi.org/10.1016/j.physa.2015.10.005

Efficient algorithms for three‐dimensional axial and planar random assignment problems

Alan Frieze and Gregory B. Sorkin
Random Structures & Algorithms 46 (1) 160 (2015)
https://doi.org/10.1002/rsa.20525

Distributionally robust mixed integer linear programs: Persistency models with applications

Xiaobo Li, Karthik Natarajan, Chung-Piaw Teo and Zhichao Zheng
European Journal of Operational Research 233 (3) 459 (2014)
https://doi.org/10.1016/j.ejor.2013.07.009

One-dimensional Euclidean matching problem: Exact solutions, correlation functions, and universality

Sergio Caracciolo and Gabriele Sicuro
Physical Review E 90 (4) (2014)
https://doi.org/10.1103/PhysRevE.90.042112

Fully Distributed Optimal Channel Assignment for Open Spectrum Access

Oshri Naparstek and Amir Leshem
IEEE Transactions on Signal Processing 62 (2) 283 (2014)
https://doi.org/10.1109/TSP.2013.2285512

The Statistical Mechanics of Random Set Packing and a Generalization of the Karp-Sipser Algorithm

C. Lucibello and F. Ricci-Tersenghi
International Journal of Statistical Mechanics 2014 1 (2014)
https://doi.org/10.1155/2014/136829

Belief propagation for minimum weight many-to-one matchings in the random complete graph

Mustafa Khandwawala
Electronic Journal of Probability 19 (none) (2014)
https://doi.org/10.1214/EJP.v19-3491

Inference in particle tracking experiments by passing messages between images

M. Chertkov, L. Kroc, F. Krzakala, M. Vergassola and L. Zdeborová
Proceedings of the National Academy of Sciences 107 (17) 7663 (2010)
https://doi.org/10.1073/pnas.0910994107

An easy proof of the $\zeta(2)$ limit in the random assignment problem

Johan Wästlund
Electronic Communications in Probability 14 (none) (2009)
https://doi.org/10.1214/ECP.v14-1475

Message passing for optimization and control of a power grid: Model of a distribution system with redundancy

Lenka Zdeborová, Aurélien Decelle and Michael Chertkov
Physical Review E 80 (4) (2009)
https://doi.org/10.1103/PhysRevE.80.046112

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Prasad Chebolu, Alan Frieze, Páll Melsted and Gregory B. Sorkin
Lecture Notes in Computer Science, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 5687 434 (2009)
https://doi.org/10.1007/978-3-642-03685-9_33

Asymptotic behavior of the expected optimal value of the multidimensional assignment problem

Pavlo A. Krokhmal, Don A. Grundel and Panos M. Pardalos
Mathematical Programming 109 (2-3) 525 (2007)
https://doi.org/10.1007/s10107-006-0036-x

The marriage problem: From the bar of appointments to the agency

Alejandro Lage-Castellanos and Roberto Mulet
Physica A: Statistical Mechanics and its Applications 364 389 (2006)
https://doi.org/10.1016/j.physa.2005.08.042

Asymptotic Results for Random Multidimensional Assignment Problems

Don Grundel, Carlos A. S. Oliveira, Panos M. Pardalos and Eduardo Pasiliao
Computational Optimization and Applications 31 (3) 275 (2005)
https://doi.org/10.1007/s10589-005-3227-0

A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment

Johan Wästlund
Random Structures & Algorithms 26 (1-2) 237 (2005)
https://doi.org/10.1002/rsa.20066

Scaling and universality in continuous length combinatorial optimization

David Aldous and Allon G. Percus
Proceedings of the National Academy of Sciences 100 (20) 11211 (2003)
https://doi.org/10.1073/pnas.1635191100

Randomization and Approximation Techniques in Computer Science

Don Coppersmith and Gregory B. Sorkin
Lecture Notes in Computer Science, Randomization and Approximation Techniques in Computer Science 1518 319 (1998)
https://doi.org/10.1007/3-540-49543-6_25