Concept

Discrete optimization

Discrete optimization is a branch of optimization in applied mathematics and computer science. As opposed to continuous optimization, some or all of the variables used in a discrete mathematical program are restricted to be discrete variables—that is, to assume only a discrete set of values, such as the integers. Three notable branches of discrete optimization are: combinatorial optimization, which refers to problems on graphs, matroids and other discrete structures integer programming constraint programming These branches are all closely intertwined however since many combinatorial optimization problems can be modeled as integer programs (e.g. shortest path) or constraint programs, any constraint program can be formulated as an integer program and vice versa, and constraint and integer programs can often be given a combinatorial interpretation.

Source officielle

https://en.wikipedia.org/wiki/Discrete_optimization

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Cours associés (4)

COM-406: Foundations of Data Science

We discuss a set of topics that are important for the understanding of modern data science but that are typically not taught in an introductory ML course. In particular we discuss fundamental ideas and techniques that come from probability, information the ...

MATH-410: Riemann surfaces

This course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex domains under discontinuous group actions, as algebraic ...

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, disc ...

Afficher plus

Publications associées (4)

Entanglement-assisted variational algorithm for discrete optimization problems

Vincenzo Savona

From fundamental sciences to economics and industry, discrete optimization problems are ubiquitous. Yet, their complexity often renders exact solutions intractable, necessitating the use of approximate methods. Heuristics inspired by classical physics have long played a central role in this domain. More recently, quantum annealing has emerged as a promising alternative, with hardware implementations realized on both analog and digital quantum devices. Here, we develop a heuristic inspired by quantum anneali

Springer Science and Business Media LLC2025

Metaheuristics and Local Search

Dominique de Werra

Combinatorial optimization, which includes sports scheduling problems as one of its areas of application, consists in finding optimal solutions to problems defined over a discrete set of feasible solutions. This chapter overviews approximate optimization methods, from greedy and semi-greedy construction algorithms to local search and from local search to metaheuristics. Some fundamental principles of metaheuristics are reviewed, and their templates are provided. Several approaches to sports scheduling probl

Springer Nature2023

Sizing and siting of a utility scale distributed battery energy storage system

The report focuses on the development of a practical and scalable methodology for the planning and operation of Active Distribution Networks (ADNs) with particular reference to the integration of Energy Storage Systems (ESSs) owned, and directly controlled, by the Distribution Network Operators (DNOs). In this respect, an exact convex formulation of the Optimal Power Flow (OPF) problem, called Augmented Relaxed OPF (AR-OPF), is first proposed for the case of radial power networks [1]-[3]. The proposed formu

SCCER-FURIES2017

Afficher plus

Concepts associés (4)

Mathématiques appliquées

vignette|280px|En théorie des graphes, principales topologies typiques de graphes. Les mathématiques appliquées sont une branche des mathématiques qui s'intéresse à l'application du savoir mathématique aux autres domaines.

Variable discrète

In mathematics and statistics, a quantitative variable may be continuous or discrete if they are typically obtained by measuring or counting, respectively. If it can take on two particular real values such that it can also take on all real values between them (even values that are arbitrarily close together), the variable is continuous in that interval. If it can take on a value such that there is a non-infinitesimal gap on each side of it containing no values that the variable can take on, then it is discrete around that value.

Optimisation combinatoire

L’optimisation combinatoire, (sous-ensemble à nombre de solutions finies de l'optimisation discrète), est une branche de l'optimisation en mathématiques appliquées et en informatique, également liée à la recherche opérationnelle, l'algorithmique et la théorie de la complexité. Dans sa forme la plus générale, un problème d'optimisation combinatoire (sous-ensemble à nombre de solutions finies de l'optimisation discrète) consiste à trouver dans un ensemble discret un parmi les meilleurs sous-ensembles (ou solutions) réalisables, la notion de meilleure solution étant définie par une fonction objectif.

Afficher plus

Graph Chat

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Source officielle

https://en.wikipedia.org/wiki/Discrete_optimization

À propos de ce résultat

Cours associés (4)

COM-406: Foundations of Data Science

MATH-410: Riemann surfaces

CS-101: Advanced information, computation, communication I

Afficher plus

Séances de cours associées (32)

Optimisation discrète : définir la couverture MOOC: Optimisation : principes et algorithmes - Optimisation discrète et en réseau

Explore le problème de couverture de l'ensemble à travers l'exemple de compléter une collection d'autocollants à un coût minimum.

Optimisation discrète: problème de vendeur itinérant MOOC: Optimisation : principes et algorithmes - Optimisation discrète et en réseau

Couvre le problème des vendeurs itinérants, la modélisation, les contraintes, les contraintes supplémentaires et la représentation du réseau.

Optimisation discrète : la malédiction de la dimensionnalité MOOC: Optimisation : principes et algorithmes - Optimisation discrète et en réseau

Plonge dans la malédiction de la dimensionnalité en optimisation discrète, mettant en évidence les défis de la croissance exponentielle du temps de calcul avec la taille du problème.

Afficher plus

Publications associées (4)

Entanglement-assisted variational algorithm for discrete optimization problems

Vincenzo Savona

Springer Science and Business Media LLC2025

Metaheuristics and Local Search

Dominique de Werra

Springer Nature2023

Sizing and siting of a utility scale distributed battery energy storage system

SCCER-FURIES2017

Afficher plus

Personnes associées (6)

Auke Ijspeert

Auke Ijspeert is a full professor at the EPFL, and head of the Biorobotics Laboratory (BioRob). He has a B.Sc./M.Sc. in physics from the EPFL (1995), and a PhD in artificial intelligence from the University of Edinburgh (1999). He carried out postdocs at IDSIA and EPFL, and at the University of Southern California (USC). He then became a research assistant professor at USC, and an external collaborator at ATR (Advanced Telecommunications Research institute) in Japan. In 2002, he came back to the EPFL as an SNF assistant professor. He was promoted to associate professor in October 2009 and to full professor in April 2016. His primary affiliation is with the Institute of Bioengineering, and secondary affiliation with the Institute of Mechanical Engineering. His research interests are at the intersection between robotics, computational neuroscience, nonlinear dynamical systems, and machine learning. He is interested in using numerical simulations and robots to get a better understanding of sensorimotor coordination in animals, and in using inspiration from biology to design novel types of robots and adaptive controllers. (see for instance Ijspeert et al Science 2007, Ijspeert Science 2014, and Nyakatura et al Nature 2019). He is also investigating how to assist people with limited mobility using exoskeletons and assistive furniture. He is regularly invited to give talks on these topics (e.g. TED talk given at TED Global Geneva, Dec 8 2015). With his colleagues, he has received paper awards at ICRA2002, CLAWAR2005, IEEE Humanoids 2007, IEEE ROMAN 2014, CLAWAR 2015, SAB2018, and CLAWAR 2019. He is an IEEE Fellow, member of the Board of Reviewing Editors of Science magazine, and associate editor for the IEEE Transactions on Medical Robotics and Bionics and for the International Journal of Humanoid Robotics. He has acted as an associate editor for the IEEE Transactions on Robotics (2009-2013) and for Soft Robotics (2018-2021). He was a guest editor for the Proceedings of IEEE, IEEE Transactions on Biomedical Engineering, Autonomous Robots, IEEE Robotics and Automation Magazine, and Biological Cybernetics. He has been the organizer of 7 international conferences (BioADIT2004, SAB2004, AMAM2005, BioADIT2006, LATSIS2006, SSRR2016, AMAM2019), and a program committee member of over 50 conferences.

Luc Reymond

Boris Buffoni

RechercheDomaines de recherche actuels https://sma.epfl.ch/~buffoni/home.html Enseignement et PhD Cours Analyse II MATH-106(b) Étudier les concepts fondamentaux d'analyse et le calcul différentiel et intégral des fonctions réelles de plusieursvariables. Analyse fonctionnelle I MATH-302 Concepts de base de l'analyse fonctionnelle linéaire: opérateurs bornés, opérateurs compacts, théorie spectrale pour les opérateurs symétriques et compacts, le théorème de Hahn-Banach, les théo

Marco Picasso

Expertise Computational Science and Engineering Mission I am teaching analysis and numerical analysis for engineers and mathematicians at bachelor and master levels.My research pertains to the numerical simulation of complex physical systems with partial differential equations.Here is some bibliometry: Google Scholar, Research Gate, Orcid, here is my most recent CV. Ongoing research projects: - Numerical simulation of aluminium electrolysis, collaboration with RioTinto LRF lab, Ycoorsystems SA and Jacques

Jan Sickmann Hesthaven

Prof. Hesthaven received an M.Sc. in computational physics from the Technical University of Denmark (DTU) in August 1991. During the studies, the last 6 months of 1989 was spend at JET, the european fusion laboratory in Culham, UK. Following graduation, he was awarded a 3 year fellowship to begin work towards a Ph.D. at Riso National Laboratory in the Department of Optics and Fluid Dynamics. During the 3 years of study, the academic year of 1993-1994 was spend in the Division of Applied Mathematics at Brown University and three 3 months during the summer of 1994 in Department of Mathematics and Statistics at University of New Mexico. In August 1995, he recieved a Ph.D. in Numerical Analysis from the Institute of Mathematical Modelling (DTU). Following graduation in August 1995, he was awarded an NSF Postdoctoral Fellowship in Advanced Scientific Computing and was approinted Visiting Assistant Professor in the Division of Applied Mathematics at Brown University. In December of 1996, he was appointed consultant to the Institute of Computer Applications in Science and Engineering(ICASE) at NASA Langley Research Center (NASA LaRC). As of July 1999, he was appointed Assistant Professor of Applied Mathematics, in September 2000 he was awarded an Alfred P. Sloan Fellowship, as of July 2001 he was awarded a Manning Assistant Professorship, and in March 2002, he was awarded an NSF Career Award. In January 2003, he was promoted to Associate Professor of Applied Mathematics with tenure and in May 2004 he was awarded Philip J. Bray Award for Excellence in Teaching in the Sciences (the highest award given for teaching excellence in all sciences at Brown University). He was promoted to Professor of Applied Mathematics as of July 2005. From October 2006 to June 2013, he was the Founding Director of the Center for Computation and Visualization (CCV) at Brown University. As of October 2007, he holds the (honorary) title of Professor (Adjunct) at the Technical University of Denmark. In November 2009, he successfully defended his dr.techn thesis at the Technical University of Denmark and was rewarded the degree of Doctor Technices -- the highest academic distinction awarded based on ... substantial and lasting contributions that has helped to move the research area forward and penetrated into applications. As grant Co-PI he served from Aug 2010 to June 2013 as Deputy Director of the Institute of Computational and Experimental Research in Mathematics (ICERM), the newest NSF Mathematical Sciences Research Institute. After having spend his entire academic career at Brown University, Prof Hesthaven decided to pursue new challenges and joined the Mathematics Institute of Computational Science and Engineering (MATHICSE) at Ecole Polytechnique Fédérale de Lausanne (EPFL) in Switzerland in July 2013. In March 2014 he was elected SIAM Fellow for contributions to high-order methods for partial differential equations.

Jiannong Fang

Enseignement et PhD A dirigé les thèses EPFL de Marco Giovanni Giometto A co-dirigé les thèses EPFL de Gaofeng Zhao

Concepts associés (4)

Mathématiques appliquées

Variable discrète

Optimisation combinatoire

Afficher plus

Personnes associées (6)

Jan Sickmann Hesthaven

Jiannong Fang

Enseignement et PhD A dirigé les thèses EPFL de Marco Giovanni Giometto A co-dirigé les thèses EPFL de Gaofeng Zhao