default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiguel F. Anjos
Person information
- affiliation: University of Edinburgh, School of Mathematics, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j66]Vinicius Neves Motta, Miguel F. Anjos
, Michel Gendreau:
Survey of optimization models for power system operation and expansion planning with demand response. Eur. J. Oper. Res. 312(2): 401-412 (2024)- [j65]Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne:
Robust bilevel optimization for near-optimal lower-level solutions. J. Glob. Optim. 90(4): 813-842 (2024) - [c16]Egon Persak, Miguel F. Anjos:
Learning Deterministic Surrogates for Robust Convex QCQPs. CPAIOR (2) 2024: 128-140 - [i8]Egon Persak, Miguel F. Anjos:
Decision-Focused Forecasting: Decision Losses for Multistage Optimisation. CoRR abs/2405.14719 (2024) - [i7]Egon Persak, Miguel F. Anjos, Sebastian Lautz, Aleksandar Kolev:
Multiple-Resolution Tokenization for Time Series Forecasting with an Application to Pricing. CoRR abs/2407.03185 (2024) - 2023
- [j64]Junkai He, Selma Khebbache, Miguel F. Anjos, Makhlouf Hadji:
Optimization of maintenance for complex manufacturing systems using stochastic Remaining Useful Life prognostics. Comput. Ind. Eng. 182: 109348 (2023) - [j63]Vinicius Neves Motta, Miguel F. Anjos, Michel Gendreau:
Optimal allocation of demand response considering transmission system congestion. Comput. Manag. Sci. 20(1): 25 (2023) - [j62]Steven Lamontagne, Margarida Carvalho, Emma Frejinger, Bernard Gendron, Miguel F. Anjos, Ribal Atallah:
Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models. INFORMS J. Comput. 35(5): 1195-1213 (2023) - [c15]Egon Persak, Miguel F. Anjos:
Contextual Robust Optimisation with Uncertainty Quantification. CPAIOR 2023: 124-132 - [c14]Junkai He, Selma Khebbache, Miguel F. Anjos, Makhlouf Hadji:
Predictive Maintenance Optimization Under Stochastic Production in Complex Systems. ICORES (Selected Papers) 2023: 47-68 - [i6]Pierre-Luc Parent, Margarida Carvalho, Miguel F. Anjos, Ribal Atallah:
Maximum flow-based formulation for the optimal location of electric vehicle charging stations. CoRR abs/2312.05980 (2023) - [i5]Egon Persak, Miguel F. Anjos:
Learning Deterministic Surrogates for Robust Convex QCQPs. CoRR abs/2312.12485 (2023) - 2022
- [j61]Vilmar Jefté Rodrigues de Sousa, Miguel F. Anjos, Sébastien Le Digabel:
Computational study of a branching algorithm for the maximum k-cut problem. Discret. Optim. 44(Part): 100656 (2022) - [j60]Miguel F. Anjos, Tibor Illés, Tamás Terlaky:
Celebrating 20 years of EUROpt. EURO J. Comput. Optim. 10: 100036 (2022) - [j59]Miguel F. Anjos, Falk M. Hante, Frauke Liers:
Special issue on Energy Networks. Math. Methods Oper. Res. 95(3): 361-363 (2022) - [c13]Junkai He, Miguel F. Anjos, Makhlouf Hadji, Selma Khebbache:
Prognostic-based Maintenance Optimization in Complex Systems with Resource Limitation Constraints. ICORES 2022: 169-176 - [c12]Charly Alizadeh, Pegah Alizadeh, Miguel F. Anjos, Lucas Létocart, Emiliano Traversi:
How to Learn the Optimal Clique Decompositions in Solving Semidefinite Relaxations for OPF. IJCNN 2022: 1-8 - 2021
- [j58]Jesús A. Rodríguez, Miguel F. Anjos, Pascal Côté, Guy Desaulniers:
Accelerating Benders decomposition for short-term hydropower maintenance scheduling. Eur. J. Oper. Res. 289(1): 240-253 (2021) - [j57]Mathieu Tanneau, Miguel F. Anjos, Andrea Lodi:
Design and implementation of a modular interior-point solver for linear optimization. Math. Program. Comput. 13(3): 509-551 (2021) - [j56]Paula Fermín Cueto, Ivona Gjeroska, Albert Solà Vilalta, Miguel F. Anjos:
A solution approach for multi-trip vehicle routing problems with time windows, fleet sizing, and depot location. Networks 78(4): 503-522 (2021) - [j55]Miguel F. Anjos, Manuel V. C. Vieira:
Mathematical optimization approach for facility layout on several rows. Optim. Lett. 15(1): 9-23 (2021) - [j54]Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne:
Complexity of near-optimal robust versions of multilevel optimization problems. Optim. Lett. 15(8): 2597-2610 (2021) - [j53]Miguel F. Anjos, Youssouf Emine, Andrea Lodi, Zhao Sun:
A note on the Lasserre hierarchy for different formulations of the maximum independent set problem. Oper. Res. Lett. 49(1): 30-34 (2021) - [i4]Julie Sliwak, Miguel F. Anjos, Lucas Létocart, Emiliano Traversi:
A Semidefinite Optimization-based Branch-and-Bound Algorithm for Several Reactive Optimal Power Flow Problems. CoRR abs/2103.13648 (2021) - 2020
- [j52]Adham I. Tammam, Miguel F. Anjos, Michel Gendreau:
Balancing supply and demand in the presence of renewable generation via demand response for electric water heaters. Ann. Oper. Res. 292(2): 753-770 (2020) - [j51]Miguel F. Anjos, José Neto:
A class of spectral bounds for Max k-Cut. Discret. Appl. Math. 279: 12-24 (2020) - [j50]Miguel F. Anjos, Bernard Gendron, Martim Joyce-Moniz:
Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel. Eur. J. Oper. Res. 285(1): 263-278 (2020) - [j49]Thibault Barbier, Miguel F. Anjos, Fabien Cirinei, Gilles Savard:
Product-closing approximation for ranking-based choice network revenue management. Eur. J. Oper. Res. 286(3): 1002-1017 (2020) - [j48]Miguel F. Anjos, Fabian Bastin, Sébastien Le Digabel, Andrea Lodi:
Preface to the special issue of INFOR on "continuous optimization and applications in machine learning and data analytics". INFOR Inf. Syst. Oper. Res. 58(2): 167 (2020) - [j47]Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne, Juan A. Gómez-Herrera:
A Bilevel Approach for Optimal Price-Setting of Time-and-Level-of-Use Tariffs. IEEE Trans. Smart Grid 11(6): 5462-5465 (2020) - [i3]Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne:
Complexity of near-optimal robust versions of multilevel optimization problems. CoRR abs/2011.00824 (2020)
2010 – 2019
- 2019
- [j46]Franklin Djeumou Fomeni, Steven A. Gabriel, Miguel F. Anjos:
An RLT approach for solving the binary-constrained mixed linear complementarity problem. Comput. Oper. Res. 110: 48-59 (2019) - [j45]Miguel F. Anjos, José Neto:
Spectral bounds for graph partitioning with prescribed partition sizes. Discret. Appl. Math. 269: 200-210 (2019) - [j44]Vilmar Jefté Rodrigues de Sousa, Miguel F. Anjos, Sébastien Le Digabel:
Improving the linear relaxation of maximum k-cut with semidefinite-based constraints. EURO J. Comput. Optim. 7(2): 123-151 (2019) - [j43]Franklin Djeumou Fomeni, Steven A. Gabriel, Miguel F. Anjos:
Applications of logic constrained equilibria to traffic networks and to power systems with storage. J. Oper. Res. Soc. 70(2): 310-325 (2019) - [i2]Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne:
Near-optimal Robust Bilevel Optimization. CoRR abs/1908.04040 (2019) - [i1]Julie Sliwak, Miguel F. Anjos, Lucas Létocart, Jean Maeght, Emiliano Traversi:
Improving Clique Decompositions of Semidefinite Relaxations for Optimal Power Flow Problems. CoRR abs/1912.09232 (2019) - 2018
- [j42]Miguel F. Anjos, Antoine Deza:
Paths, pivots, and practice: the power of optimization. Ann. Oper. Res. 265(1): 1-4 (2018) - [j41]Vilmar Jefté Rodrigues de Sousa, Miguel F. Anjos, Sébastien Le Digabel:
Computational study of valid inequalities for the maximum k-cut problem. Ann. Oper. Res. 265(1): 5-27 (2018) - [j40]Miguel F. Anjos, Anja Fischer, Philipp Hungerländer:
Improved exact approaches for row layout problems with departments of equal length. Eur. J. Oper. Res. 270(2): 514-529 (2018) - [j39]Miguel F. Anjos, Manuel V. C. Vieira:
Preface to the INFOR special issues on facility layout. INFOR Inf. Syst. Oper. Res. 56(4): 361-363 (2018) - [c11]Miguel F. Anjos, Philipp Hungerländer, Kerstin Maier:
An Integer Linear Programming Approach for the Combined Cell Layout Problem. IEEM 2018: 705-709 - 2017
- [j38]Miguel F. Anjos, Manuel V. C. Vieira:
On semidefinite least squares and minimal unsatisfiability. Discret. Appl. Math. 217: 79-96 (2017) - [j37]Miguel F. Anjos, Manuel V. C. Vieira:
Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions. Eur. J. Oper. Res. 261(1): 1-16 (2017) - 2016
- [j36]Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos:
A dynamic inequality generation scheme for polynomial programming. Math. Program. 156(1-2): 21-57 (2016) - [j35]Miguel F. Anjos, Manuel V. C. Vieira:
An improved two-stage optimization-based framework for unequal-areas facility layout. Optim. Lett. 10(7): 1379-1392 (2016) - 2015
- [j34]Philipp Hungerländer, Miguel F. Anjos:
A semidefinite optimization-based approach for global optimization of multi-row facility layout. Eur. J. Oper. Res. 245(1): 46-61 (2015) - [j33]François Gilbert, Miguel F. Anjos, Patrice Marcotte, Gilles Savard:
Optimal design of bilateral contracts for energy procurement. Eur. J. Oper. Res. 246(2): 641-650 (2015) - [j32]Elspeth Adams, Miguel F. Anjos, Franz Rendl, Angelika Wiegele:
A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems. INFOR Inf. Syst. Oper. Res. 53(1): 40-48 (2015) - [j31]James Ostrowski, Miguel F. Anjos, Anthony Vannelli:
Modified orbital branching for structured symmetry with an application to unit commitment. Math. Program. 150(1): 99-129 (2015) - 2014
- [j30]Miguel F. Anjos, Xiao-Wen Chang, Wen-Yang Ku:
Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems. J. Glob. Optim. 59(2-3): 227-242 (2014) - [c10]Miguel F. Anjos, Anja Fischer, Philipp Hungerländer:
Solution Approaches for the Double-Row Equidistant Facility Layout Problem. OR 2014: 17-23 - 2013
- [j29]Miguel F. Anjos, Manuel V. C. Vieira:
Semidefinite resolution and exactness of semidefinite relaxations for satisfiability. Discret. Appl. Math. 161(18): 2812-2826 (2013) - [j28]Sabrina Bernardi, Miguel F. Anjos:
A two-stage mathematical-programming method for the multi-floor facility layout problem. J. Oper. Res. Soc. 64(3): 352-364 (2013) - [j27]Alexander Engau, Miguel F. Anjos, Immanuel M. Bomze:
Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem. Math. Methods Oper. Res. 78(1): 35-59 (2013) - 2012
- [j26]Alexander Engau, Miguel F. Anjos, Anthony Vannelli:
On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems. Optim. Methods Softw. 27(3): 539-559 (2012) - [j25]Giuseppe Tommaso Costanzo, Guchuan Zhu, Miguel F. Anjos, Gilles Savard:
A System Architecture for Autonomous Demand Side Load Management in Smart Buildings. IEEE Trans. Smart Grid 3(4): 2157-2165 (2012) - [c9]Miguel F. Anjos:
Optimization Challenges in Smart Grid Operations. CP 2012: 2-3 - [c8]Giuseppe Tommaso Costanzo, Anna Magdalena Kosek, Guchuan Zhu, Luca Ferrarini, Miguel F. Anjos, Gilles Savard:
An experimental study on load-peak shaving in smart homes by means of online admission control. ISGT Europe 2012: 1-8 - [c7]Philipp Hungerländer, Miguel F. Anjos:
An Exact Approach for the Combined Cell Layout Problem. OR 2012: 275-281 - 2011
- [j24]Bissan Ghaddar, Miguel F. Anjos, Frauke Liers:
A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem. Ann. Oper. Res. 188(1): 155-174 (2011) - [j23]Ibolya Jankovits, Chaomin Luo, Miguel F. Anjos, Anthony Vannelli:
A convex optimisation framework for the unequal-areas facility layout problem. Eur. J. Oper. Res. 214(2): 199-215 (2011) - [j22]Miguel F. Anjos, Etienne de Klerk, Franz Rendl:
Preface. Math. Program. 129(1): 1-3 (2011) - [j21]Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos:
Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs. SIAM J. Optim. 21(1): 391-414 (2011) - [c6]Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos:
An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming. IPCO 2011: 207-222 - 2010
- [j20]Alexander Engau, Miguel F. Anjos, Anthony Vannelli:
An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization. Electron. Notes Discret. Math. 36: 743-750 (2010) - [j19]Alexander Engau, Miguel F. Anjos, Anthony Vannelli:
On Interior-Point Warmstarts for Linear and Combinatorial Optimization. SIAM J. Optim. 20(4): 1828-1861 (2010) - [c5]James Ostrowski, Miguel F. Anjos, Anthony Vannelli:
Tight mixed integer linear programming formulations for generator Self-Scheduling. CCECE 2010: 1-4
2000 – 2009
- 2009
- [j18]Miguel F. Anjos, Ginger Yen:
Provably near-optimal solutions for very large single-row facility layout problems. Optim. Methods Softw. 24(4-5): 805-817 (2009) - 2008
- [j17]Miguel F. Anjos, Anthony Vannelli:
Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes. INFORMS J. Comput. 20(4): 611-617 (2008) - [j16]Chaomin Luo, Miguel F. Anjos, Anthony Vannelli:
A nonlinear optimization methodology for VLSI fixed-outline floorplanning. J. Comb. Optim. 16(4): 378-401 (2008) - [j15]Miguel F. Anjos:
An Extended Semidefinite Relaxation for Satisfiability. J. Satisf. Boolean Model. Comput. 4(1): 15-31 (2008) - [c4]Chaomin Luo, Miguel F. Anjos, Anthony Vannelli:
Large-scale fixed-outline floorplanning design using convex optimization techniques. ASP-DAC 2008: 198-203 - 2007
- [j14]Miguel F. Anjos, Samuel Burer:
On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization. SIAM J. Optim. 18(4): 1310-1325 (2007) - 2006
- [j13]Miguel F. Anjos:
An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs. Ann. Math. Artif. Intell. 48(1-2): 1-14 (2006) - [j12]Miguel F. Anjos, Anthony Vannelli:
A New Mathematical-Programming Framework for Facility-Layout Design. INFORMS J. Comput. 18(1): 111-118 (2006) - [j11]Miguel F. Anjos:
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems. J. Satisf. Boolean Model. Comput. 1(1): 1-47 (2006) - [c3]Miguel F. Anjos, Michael Desroches, Anwar Haque, Oleg Grodzevich, Hua Wei, Henry Wolkowicz:
Multi-Stage Investment Decision under Contingent Demand for Networking Planning. GLOBECOM 2006 - 2005
- [j10]Miguel F. Anjos, Andrew A. Kennings, Anthony Vannelli:
A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discret. Optim. 2(2): 113-122 (2005) - [j9]Miguel F. Anjos, Russell C. H. Cheng, Christine S. M. Currie:
Optimal pricing policies for perishable products. Eur. J. Oper. Res. 166(1): 246-254 (2005) - [j8]Miguel F. Anjos:
An improved semidefinite programming relaxation for the satisfiability problem. Math. Program. 102(3): 589-608 (2005) - [c2]Pawoumodom L. Takouda, Miguel F. Anjos, Anthony Vannelli:
Global Lower Bounds for the VLSI Macrocell Floorplanning Problem Using Semidefinite Optimization. IWSOC 2005: 275-280 - [c1]Miguel F. Anjos, Anthony Vannelli:
On the Computational Performance of a Semidefinite Programming Approach to Single Row Layout Problems. OR 2005: 277-282 - 2004
- [j7]Miguel F. Anjos, Russell C. H. Cheng, Christine S. M. Currie:
Maximizing revenue in the airline industry under one-way pricing. J. Oper. Res. Soc. 55(5): 535-541 (2004) - [j6]Miguel F. Anjos:
On semidefinite programming relaxations for the satisfiability problem. Math. Methods Oper. Res. 60(3): 349-367 (2004) - 2002
- [j5]Miguel F. Anjos, Henry Wolkowicz:
Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem. Discret. Appl. Math. 119(1-2): 79-106 (2002) - [j4]Henry Wolkowicz, Miguel F. Anjos:
Semidefinite programming for discrete optimization and matrix completion problems. Discret. Appl. Math. 123(1-3): 513-577 (2002) - [j3]Miguel F. Anjos, Henry Wolkowicz:
Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks. J. Comb. Optim. 6(3): 237-270 (2002) - [j2]Miguel F. Anjos, Anthony Vannelli:
An Attractor-Repeller approach to floorplanning. Math. Methods Oper. Res. 56(1): 3-27 (2002) - 2001
- [b1]Miguel F. Anjos:
New Convex Relaxations for the Maximum Cut and VLSI Layout Problems. University of Waterloo, Ontario, Canada, 2001
1990 – 1999
- 1993
- [j1]Miguel F. Anjos:
A Modified Broyden Update with Interpolation. SIAM J. Sci. Comput. 14(6): 1359-1367 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-14 00:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
