| Publication | Date of Publication | Type |
|---|
Discrete optimization methods to fit piecewise affine models to data points
Computers \& Operations Research | 2016-11-17 | Paper |
On the computational complexity of the virtual network embedding problem
| 2016-10-18 | Paper |
Maximum throughput network routing subject to fair flow allocation
Lecture Notes in Computer Science | 2015-10-16 | Paper |
A distance-based point-reassignment heuristic for the \(k\)-hyperplane clustering problem
European Journal of Operational Research | 2014-07-27 | Paper |
Coordinated cutting plane generation via multi-objective separation
Mathematical Programming. Series A. Series B | 2014-02-25 | Paper |
A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem
Computational Optimization and Applications | 2014-01-30 | Paper |
Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases
Yugoslav Journal of Operations Research | 2013-06-10 | Paper |
The minimum fundamental cycle basic problem: a new heuristic based on edge swaps
| 2013-01-10 | Paper |
Hyperbolic set covering problems with competing ground-set elements
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
On the hazmat transport network design problem
Lecture Notes in Computer Science | 2011-09-09 | Paper |
A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Solving nonlinear covering problems arising in WLAN design
Operations Research | 2011-07-19 | Paper |
On minimum reload cost paths, tours, and flows
Networks | 2011-06-22 | Paper |
Ectropy of diversity measures for populations in Euclidean space
Information Sciences | 2011-06-22 | Paper |
On the approximability of the minimum strictly fundamental cycle basis problem
Discrete Applied Mathematics | 2011-03-09 | Paper |
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Breaking the O(m 2 n) Barrier for Minimum Cycle Bases
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Edge-swapping algorithms for the minimum fundamental cycle basis problem
Mathematical Methods of Operations Research | 2009-04-27 | Paper |
Optimization models and methods for planning wireless mesh networks
Computer Networks | 2008-08-15 | Paper |
Boundedness Theorems for the Relaxation Method
Mathematics of Operations Research | 2008-05-27 | Paper |
A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
Computers \& Operations Research | 2007-11-06 | Paper |
Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Optimization problems and models for planning cellular networks
| 2007-07-23 | Paper |
Virtual Private Network Design Under Traffic Uncertainty
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Algorithms for finding minimum fundamental cycle bases in graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Optimizing base station location and configuration in UMTS networks
Annals of Operations Research | 2007-02-05 | Paper |
Provisioning virtual private networks under traffic uncertainty
Networks | 2007-02-02 | Paper |
scientific article; zbMATH DE number 2230231 (Why is no real title available?)
| 2005-11-18 | Paper |
On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
Mathematical Programming. Series A. Series B | 2003-07-13 | Paper |
scientific article; zbMATH DE number 1746659 (Why is no real title available?)
| 2002-06-09 | Paper |
The MIN PFS problem and piecewise linear model estimation
Discrete Applied Mathematics | 2002-05-15 | Paper |
scientific article; zbMATH DE number 1414323 (Why is no real title available?)
| 2000-03-16 | Paper |
scientific article; zbMATH DE number 1342119 (Why is no real title available?)
| 1999-11-21 | Paper |
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
Theoretical Computer Science | 1999-01-12 | Paper |
The complexity and approximability of finding maximum feasible subsystems of linear relations
Theoretical Computer Science | 1997-09-29 | Paper |
A review of combinatorial problems arising in feedforward neural network design
Discrete Applied Mathematics | 1994-08-29 | Paper |
