Miguel F. Anjos

Orcid: 0000-0002-8258-9116

Affiliations:
  • University of Edinburgh, School of Mathematics, UK


According to our database1, Miguel F. Anjos authored at least 85 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Survey of optimization models for power system operation and expansion planning with demand response.
Eur. J. Oper. Res., January, 2024

2023
Optimal allocation of demand response considering transmission system congestion.
Comput. Manag. Sci., December, 2023

Optimization of maintenance for complex manufacturing systems using stochastic Remaining Useful Life prognostics.
Comput. Ind. Eng., August, 2023

Learning Deterministic Surrogates for Robust Convex QCQPs.
CoRR, 2023

Maximum flow-based formulation for the optimal location of electric vehicle charging stations.
CoRR, 2023

Predictive Maintenance Optimization Under Stochastic Production in Complex Systems.
Proceedings of the Operations Research and Enterprise Systems, 2023

Contextual Robust Optimisation with Uncertainty Quantification.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

2022
Special issue on Energy Networks.
Math. Methods Oper. Res., 2022

Celebrating 20 years of EUR<i>O</i>pt.
EURO J. Comput. Optim., 2022

Computational study of a branching algorithm for the maximum k-cut problem.
Discret. Optim., 2022

How to Learn the Optimal Clique Decompositions in Solving Semidefinite Relaxations for OPF.
Proceedings of the International Joint Conference on Neural Networks, 2022

Prognostic-based Maintenance Optimization in Complex Systems with Resource Limitation Constraints.
Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022

2021
A note on the Lasserre hierarchy for different formulations of the maximum independent set problem.
Oper. Res. Lett., 2021

Complexity of near-optimal robust versions of multilevel optimization problems.
Optim. Lett., 2021

Mathematical optimization approach for facility layout on several rows.
Optim. Lett., 2021

A solution approach for multi-trip vehicle routing problems with time windows, fleet sizing, and depot location.
Networks, 2021

Design and implementation of a modular interior-point solver for linear optimization.
Math. Program. Comput., 2021

Accelerating Benders decomposition for short-term hydropower maintenance scheduling.
Eur. J. Oper. Res., 2021

A Semidefinite Optimization-based Branch-and-Bound Algorithm for Several Reactive Optimal Power Flow Problems.
CoRR, 2021

2020
A Bilevel Approach for Optimal Price-Setting of Time-and-Level-of-Use Tariffs.
IEEE Trans. Smart Grid, 2020

Preface to the special issue of INFOR on "continuous optimization and applications in machine learning and data analytics".
INFOR Inf. Syst. Oper. Res., 2020

Product-closing approximation for ranking-based choice network revenue management.
Eur. J. Oper. Res., 2020

Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel.
Eur. J. Oper. Res., 2020

A class of spectral bounds for Max k-Cut.
Discret. Appl. Math., 2020

Balancing supply and demand in the presence of renewable generation via demand response for electric water heaters.
Ann. Oper. Res., 2020

2019
Applications of logic constrained equilibria to traffic networks and to power systems with storage.
J. Oper. Res. Soc., 2019

Improving the linear relaxation of maximum <i>k</i>-cut with semidefinite-based constraints.
EURO J. Comput. Optim., 2019

Spectral bounds for graph partitioning with prescribed partition sizes.
Discret. Appl. Math., 2019

Improving Clique Decompositions of Semidefinite Relaxations for Optimal Power Flow Problems.
CoRR, 2019

Near-optimal Robust Bilevel Optimization.
CoRR, 2019

An RLT approach for solving the binary-constrained mixed linear complementarity problem.
Comput. Oper. Res., 2019

2018
Preface to the INFOR special issues on facility layout.
INFOR Inf. Syst. Oper. Res., 2018

Improved exact approaches for row layout problems with departments of equal length.
Eur. J. Oper. Res., 2018

Computational study of valid inequalities for the maximum k-cut problem.
Ann. Oper. Res., 2018

Paths, pivots, and practice: the power of optimization.
Ann. Oper. Res., 2018

An Integer Linear Programming Approach for the Combined Cell Layout Problem.
Proceedings of the 2018 IEEE International Conference on Industrial Engineering and Engineering Management, 2018

2017
Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions.
Eur. J. Oper. Res., 2017

On semidefinite least squares and minimal unsatisfiability.
Discret. Appl. Math., 2017

2016
An improved two-stage optimization-based framework for unequal-areas facility layout.
Optim. Lett., 2016

A dynamic inequality generation scheme for polynomial programming.
Math. Program., 2016

2015
Modified orbital branching for structured symmetry with an application to unit commitment.
Math. Program., 2015

A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems.
INFOR Inf. Syst. Oper. Res., 2015

A semidefinite optimization-based approach for global optimization of multi-row facility layout.
Eur. J. Oper. Res., 2015

Optimal design of bilateral contracts for energy procurement.
Eur. J. Oper. Res., 2015

2014
Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems.
J. Glob. Optim., 2014

Solution Approaches for the Double-Row Equidistant Facility Layout Problem.
Proceedings of the Operations Research Proceedings 2014, 2014

2013
Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem.
Math. Methods Oper. Res., 2013

A two-stage mathematical-programming method for the multi-floor facility layout problem.
J. Oper. Res. Soc., 2013

Semidefinite resolution and exactness of semidefinite relaxations for satisfiability.
Discret. Appl. Math., 2013

2012
A System Architecture for Autonomous Demand Side Load Management in Smart Buildings.
IEEE Trans. Smart Grid, 2012

On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems.
Optim. Methods Softw., 2012

An Exact Approach for the Combined Cell Layout Problem.
Proceedings of the Operations Research Proceedings 2012, 2012

An experimental study on load-peak shaving in smart homes by means of online admission control.
Proceedings of the 3rd IEEE PES Innovative Smart Grid Technologies Europe, 2012

Optimization Challenges in Smart Grid Operations.
Proceedings of the Principles and Practice of Constraint Programming, 2012

2011
Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs.
SIAM J. Optim., 2011

Preface.
Math. Program., 2011

A convex optimisation framework for the unequal-areas facility layout problem.
Eur. J. Oper. Res., 2011

A branch-and-cut algorithm based on semidefinite programming for the minimum <i>k</i>-partition problem.
Ann. Oper. Res., 2011

An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
On Interior-Point Warmstarts for Linear and Combinatorial Optimization.
SIAM J. Optim., 2010

An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization.
Electron. Notes Discret. Math., 2010

Tight mixed integer linear programming formulations for generator Self-Scheduling.
Proceedings of the 23rd Canadian Conference on Electrical and Computer Engineering, 2010

2009
Provably near-optimal solutions for very large single-row facility layout problems.
Optim. Methods Softw., 2009

2008
An Extended Semidefinite Relaxation for Satisfiability.
J. Satisf. Boolean Model. Comput., 2008

A nonlinear optimization methodology for VLSI fixed-outline floorplanning.
J. Comb. Optim., 2008

Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes.
INFORMS J. Comput., 2008

Large-scale fixed-outline floorplanning design using convex optimization techniques.
Proceedings of the 13th Asia South Pacific Design Automation Conference, 2008

2007
On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization.
SIAM J. Optim., 2007

2006
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems.
J. Satisf. Boolean Model. Comput., 2006

A New Mathematical-Programming Framework for Facility-Layout Design.
INFORMS J. Comput., 2006

An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs.
Ann. Math. Artif. Intell., 2006

Multi-Stage Investment Decision under Contingent Demand for Networking Planning.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2005
An improved semidefinite programming relaxation for the satisfiability problem.
Math. Program., 2005

Optimal pricing policies for perishable products.
Eur. J. Oper. Res., 2005

A semidefinite optimization approach for the single-row layout problem with unequal dimensions.
Discret. Optim., 2005

On the Computational Performance of a Semidefinite Programming Approach to Single Row Layout Problems.
Proceedings of the Operations Research Proceedings 2005, 2005

Global Lower Bounds for the VLSI Macrocell Floorplanning Problem Using Semidefinite Optimization.
Proceedings of the 5th IEEE International Workshop on System-on-Chip for Real-Time Applications (IWSOC 2005), 2005

2004
On semidefinite programming relaxations for the satisfiability problem.
Math. Methods Oper. Res., 2004

Maximizing revenue in the airline industry under one-way pricing.
J. Oper. Res. Soc., 2004

2002
An Attractor-Repeller approach to floorplanning.
Math. Methods Oper. Res., 2002

Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks.
J. Comb. Optim., 2002

Semidefinite programming for discrete optimization and matrix completion problems.
Discret. Appl. Math., 2002

Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem.
Discret. Appl. Math., 2002

2001
New Convex Relaxations for the Maximum Cut and VLSI Layout Problems.
PhD thesis, 2001

1993
A Modified Broyden Update with Interpolation.
SIAM J. Sci. Comput., 1993


  Loading...