| Publication | Date of Publication | Type |
|---|
Solution strategies for integrated distribution, production, and relocation problems arising in modular manufacturing
European Journal of Operational Research | 2024-06-17 | Paper |
Asymptotic bounds for clustering problems in random graphs
Networks | 2024-03-15 | Paper |
On maximum ratio clique relaxations
Networks | 2023-12-12 | Paper |
Can fast food eating patterns be healthy? An optimization-based analysis of popular US fast-food chains
SN Operations Research Forum | 2023-06-05 | Paper |
Continuous cubic formulations for cluster detection problems in networks
Mathematical Programming. Series A. Series B | 2022-11-14 | Paper |
A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
SIAM Journal on Optimization | 2022-09-14 | Paper |
Networks of causal relationships in the U.S. stock market
Dependence Modeling | 2022-06-24 | Paper |
An improved approximation for maximum \(k\)-dependent set on bipartite graphs
Discrete Applied Mathematics | 2021-12-07 | Paper |
Polyhedral properties of the induced cluster subgraphs
Discrete Applied Mathematics | 2021-04-29 | Paper |
A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
INFORMS Journal on Computing | 2021-01-07 | Paper |
The maximum independent union of cliques problem: complexity and exact approaches
Journal of Global Optimization | 2020-04-21 | Paper |
The maximum number of induced open triangles in graphs of a given order
Optimization Letters | 2019-12-03 | Paper |
Algorithms for the generalized independent set problem based on a quadratic optimization approach
Optimization Letters | 2019-10-18 | Paper |
Exact algorithms for the minimum \(s\)-club partitioning problem
Annals of Operations Research | 2019-10-18 | Paper |
Scale reduction techniques for computing maximum induced bicliques
Algorithms | 2019-05-08 | Paper |
A nonconvex quadratic optimization approach to the maximum edge weight clique problem
Journal of Global Optimization | 2018-12-21 | Paper |
Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph
Networks | 2018-10-04 | Paper |
Detecting robust cliques in graphs subject to uncertain edge failures
Annals of Operations Research | 2018-06-13 | Paper |
On provably best construction heuristics for hard combinatorial optimization problems
Networks | 2018-05-11 | Paper |
On biconnected and fragile subgraphs of low diameter
European Journal of Operational Research | 2018-02-06 | Paper |
On imposing connectivity constraints in integer programs
Mathematical Programming. Series A. Series B | 2017-12-01 | Paper |
On robust clusters of minimum cardinality in networks
Annals of Operations Research | 2017-03-07 | Paper |
Distance-based clique relaxations in networks: \(s\)-clique and \(s\)-club
Springer Proceedings in Mathematics & Statistics | 2016-09-13 | Paper |
Book review of: Y. D. Sergeyev et al., Introduction to global optimization exploiting space-filling curves
SIAM Review | 2016-05-20 | Paper |
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
Computational Optimization and Applications | 2016-05-04 | Paper |
Solving the maximum clique and vertex coloring problems on very large sparse networks
INFORMS Journal on Computing | 2015-09-11 | Paper |
An integer programming approach for fault-tolerant connected dominating sets
INFORMS Journal on Computing | 2015-09-11 | Paper |
On connected dominating sets of restricted diameter
European Journal of Operational Research | 2015-07-29 | Paper |
The maximum ratio clique problem
Computational Management Science | 2015-07-29 | Paper |
Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
Optimization Letters | 2014-12-05 | Paper |
A network-based data mining approach to portfolio selection via weighted clique relaxations
Annals of Operations Research | 2014-09-26 | Paper |
On clique relaxation models in network analysis
European Journal of Operational Research | 2014-07-27 | Paper |
Computational study of the US stock market evolution: a rank correlation-based network model
Computational Management Science | 2014-03-10 | Paper |
Approximating 2-cliques in unit disk graphs
Discrete Applied Mathematics | 2014-02-18 | Paper |
Algorithms for the maximum \(k\)-club problem in graphs
Journal of Combinatorial Optimization | 2013-12-02 | Paper |
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
Computational Optimization and Applications | 2013-08-26 | Paper |
A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
Journal of Global Optimization | 2013-08-01 | Paper |
Numerical methods and optimization. An introduction
Chapman & Hall CRC Numerical Analysis and Scientific Computing Series | 2013-07-03 | Paper |
Network clustering via clique relaxation: a community based approach
| 2013-06-25 | Paper |
A distributed approximation algorithm for the bottleneck connected dominating set problem
Optimization Letters | 2012-12-28 | Paper |
On the maximum quasi-clique problem
Discrete Applied Mathematics | 2012-11-22 | Paper |
Scheduling the adjuvant endocrine therapy for early stage breast cancer
Annals of Operations Research | 2012-11-15 | Paper |
Clique relaxation models in social network analysis
Handbook of Optimization in Complex Networks | 2012-09-28 | Paper |
Clique relaxations in social network analysis: the maximum \(k\)-plex problem
Operations Research | 2011-07-19 | Paper |
On connected domination in unit ball graphs
Optimization Letters | 2011-05-20 | Paper |
Estimating the size of correcting codes using extremal graph problems
Springer Optimization and Its Applications | 2010-03-04 | Paper |
Comments on: Optimization and data mining in biomedicine
Top | 2010-01-29 | Paper |
Checking solvability of systems of interval linear equations and inequalities via mixed integer programming
European Journal of Operational Research | 2009-12-07 | Paper |
Statistical analysis of financial networks
Computational Statistics and Data Analysis | 2008-11-26 | Paper |
Using critical sets to solve the maximum independent set problem
Operations Research Letters | 2007-10-30 | Paper |
On a polynomial fractional formulation for independence number of a graph
Journal of Global Optimization | 2007-10-23 | Paper |
Graph domination, coloring and cliques in telecommunications
| 2007-07-23 | Paper |
ON THE PERFORMANCE OF HEURISTICS FOR BROADCAST SCHEDULING
Theory and Algorithms for Cooperative Systems | 2007-01-19 | Paper |
Matrix-based methods for college football rankings
| 2006-10-16 | Paper |
scientific article; zbMATH DE number 5064312 (Why is no real title available?)
| 2006-10-16 | Paper |
Mining market data: a network approach
Computers & Operations Research | 2006-08-14 | Paper |
Clique-detection models in computational biochemistry and genomics
European Journal of Operational Research | 2006-05-29 | Paper |
Constructing test functions for global optimization using continuous formulations of graph problems
Optimization Methods & Software | 2006-01-10 | Paper |
Novel approaches for analyzing biological networks
Journal of Combinatorial Optimization | 2005-12-13 | Paper |
Optimal security liquidation algorithms
Computational Optimization and Applications | 2005-11-16 | Paper |
scientific article; zbMATH DE number 2128217 (Why is no real title available?)
| 2005-01-14 | Paper |
scientific article; zbMATH DE number 1985299 (Why is no real title available?)
| 2003-09-24 | Paper |
Nonlinear dynamical systems and adaptive filters in biomedicine
Annals of Operations Research | 2003-05-11 | Paper |
A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
Journal of Combinatorial Optimization | 2002-08-20 | Paper |
On the chromatic number of graphs
Journal of Optimization Theory and Applications | 2001-08-28 | Paper |
Finding independent sets in a graph using continuous multivariable polynomial formulations.
Journal of Global Optimization | 2001-01-01 | Paper |
