| Publication | Date of Publication | Type |
|---|
A rounding and clustering-based exact algorithm for the p-center problem
Computers & Operations Research | 2025-12-02 | Paper |
Quadratization and convexification in polynomial binary optimization
Journal of Combinatorial Optimization | 2025-10-22 | Paper |
Minimizing recovery cost of network optimization problems
Networks | 2023-12-18 | Paper |
Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem
Computers & Operations Research | 2023-09-13 | Paper |
An efficient Benders decomposition for the \(p\)-median problem
European Journal of Operational Research | 2023-07-10 | Paper |
Efficient linear reformulations for binary polynomial optimization problems
Computers & Operations Research | 2023-07-04 | Paper |
Un Algorithme De Génération De Coupes Pour Le Problème De L’Affectation Quadratique
INFOR: Information Systems and Operational Research | 2023-05-05 | Paper |
Compact MILP formulations for the $p$-center problem
(available as arXiv preprint) | 2023-02-09 | Paper |
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
Journal of Global Optimization | 2021-08-11 | Paper |
Models and algorithms for the product pricing with single-minded customers requesting bundles
Computers & Operations Research | 2021-05-21 | Paper |
Optimization of wireless sensor networks deployment with coverage and connectivity constraints
Annals of Operations Research | 2021-05-05 | Paper |
Global solution of non-convex quadratically constrained quadratic programs
Optimization Methods & Software | 2019-01-14 | Paper |
| Compact MILP formulations for the \(p\)-center problem | 2018-08-17 | Paper |
Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
INFORMS Journal on Computing | 2017-10-04 | Paper |
Optimal migration planning of telecommunication equipment
Advances in Intelligent Systems and Computing | 2017-09-12 | Paper |
Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
Mathematical Programming. Series A. Series B | 2016-08-25 | Paper |
A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
Journal of Combinatorial Optimization | 2014-07-11 | Paper |
An efficient compact quadratic convex reformulation for general integer quadratic programs
Computational Optimization and Applications | 2013-02-25 | Paper |
Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
Computers & Operations Research | 2012-11-15 | Paper |
A new formulation and resolution method for the \(p\)-center problem
INFORMS Journal on Computing | 2012-06-08 | Paper |
A computational study for the \(p\)-median problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Extending the QCR method to general mixed-integer programs
Mathematical Programming. Series A. Series B | 2012-02-22 | Paper |
A tighter formulation of the \(p\)-median problem
Journal of Combinatorial Optimization | 2010-03-09 | Paper |
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
Discrete Applied Mathematics | 2009-06-23 | Paper |
Linear Reformulations of Integer Quadratic Programs
Communications in Computer and Information Science | 2009-05-13 | Paper |
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
Networks | 2008-12-17 | Paper |
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
RAIRO - Operations Research | 2008-11-19 | Paper |
Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Mathematical Programming. Series A. Series B | 2007-03-05 | Paper |
Designing radio-mobile access networks based on synchronous digital hierarchy rings
Computers & Operations Research | 2004-11-12 | Paper |
Best reduction of the quadratic semi-assignment problem
Discrete Applied Mathematics | 2002-06-17 | Paper |
Decomposition and linearization for 0-1 quadratic programming
Annals of Operations Research | 2001-06-14 | Paper |
An algorithm for finding the \(K\)-best allocations of a tree structured program
Journal of Parallel and Distributed Computing | 1995-07-20 | Paper |
Placement Des Taches D’Un Programme A Structure Arborescente Sur Un Reseau De Processeurs: Synthese De Resultats Recents
INFOR: Information Systems and Operational Research | 1994-01-01 | Paper |
Placement de tâches dans un système distribué et dualité lagrangienne
RAIRO - Operations Research | 1992-12-14 | Paper |
