| Publication | Date of Publication | Type |
|---|
Exact and heuristic solution techniques for mixed-integer quantile minimization problems
INFORMS Journal on Computing | 2024-09-05 | Paper |
Integer programming models and polyhedral study for the geodesic classification problem on graphs
European Journal of Operational Research | 2024-06-17 | Paper |
Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks
Networks | 2023-12-11 | Paper |
Computational comparisons of different formulations for the Stackelberg minimum spanning tree game
International Transactions in Operational Research | 2023-11-21 | Paper |
A survey on mixed-integer programming techniques in bilevel optimization
EURO Journal on Computational Optimization | 2023-07-12 | Paper |
Dendrograms, minimum spanning trees and feature selection
European Journal of Operational Research | 2023-07-10 | Paper |
Product line optimization with multiples sites
Computers \& Operations Research | 2022-09-27 | Paper |
A bilevel optimization approach to decide the feasibility of bookings in the European gas market
Mathematical Methods of Operations Research | 2022-07-15 | Paper |
The geodesic classification problem on graphs
| 2022-04-27 | Paper |
Multi-market portfolio optimization with conditional value at risk
European Journal of Operational Research | 2022-03-11 | Paper |
Mixed-integer formulations for the capacitated rank pricing problem with envy
Computers \& Operations Research | 2022-03-09 | Paper |
Benders decomposition for network design covering problems
Computers \& Operations Research | 2022-03-09 | Paper |
The rank pricing problem with ties
European Journal of Operational Research | 2021-11-05 | Paper |
Shortest paths and location problems in a continuous framework with different $\ell_p$-norms on different regions
| 2021-10-15 | Paper |
Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
Optimization Letters | 2021-07-08 | Paper |
Coordinating resources in Stackelberg security games
European Journal of Operational Research | 2021-06-07 | Paper |
Finding the root graph through minimum edge deletion
European Journal of Operational Research | 2021-06-03 | Paper |
Models and algorithms for the product pricing with single-minded customers requesting bundles
Computers \& Operations Research | 2021-05-21 | Paper |
Technical note -- There's no free lunch: on the hardness of choosing a correct big-\(M\) in bilevel optimization
Operations Research | 2021-01-19 | Paper |
A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
INFORMS Journal on Computing | 2021-01-07 | Paper |
An exact dynamic programming approach to segmented isotonic regression
| 2020-12-07 | Paper |
Discussion of fairness and implementability in Stackelberg security games
Lecture Notes in Computer Science | 2020-07-20 | Paper |
Benders decomposition for Network Design Covering Problems
| 2020-07-13 | Paper |
Bookings in the European gas market: characterisation of feasibility and computational complexity results
Optimization and Engineering | 2020-03-04 | Paper |
A study of general and security Stackelberg game formulations
European Journal of Operational Research | 2019-06-27 | Paper |
A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph
Discrete Applied Mathematics | 2019-05-17 | Paper |
Mixed integer linear programming for feature selection in support vector machine
Discrete Applied Mathematics | 2019-05-17 | Paper |
New models for the location of controversial facilities: a bilevel programming approach
Computers \& Operations Research | 2019-04-18 | Paper |
The rank pricing problem: models and branch-and-cut algorithms
Computers \& Operations Research | 2019-02-19 | Paper |
Lagrangian relaxation for SVM feature selection
Computers \& Operations Research | 2018-07-11 | Paper |
A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
Computers \& Operations Research | 2018-07-11 | Paper |
Network pricing problem with unit toll
Networks | 2018-06-13 | Paper |
Lexicographical order in integer programming
Vietnam Journal of Mathematics | 2017-09-25 | Paper |
Improved integer linear programming formulations for the job sequencing and tool switching problem
European Journal of Operational Research | 2016-10-06 | Paper |
A branch-cut-and-price algorithm for the piecewise linear transportation problem
European Journal of Operational Research | 2016-10-06 | Paper |
Bilevel programming and price setting problems
Annals of Operations Research | 2016-07-22 | Paper |
The balanced minimum evolution problem
INFORMS Journal on Computing | 2016-06-29 | Paper |
Identification of all steady states in large networks by logical analysis
Bulletin of Mathematical Biology | 2016-03-08 | Paper |
Comments on: ``Static and dynamic source locations in undirected networks
Top | 2015-11-06 | Paper |
The balanced minimum evolution problem under uncertain data
Discrete Applied Mathematics | 2014-04-22 | Paper |
A branch-and-cut algorithm for the ring spur assignment problem
Networks | 2013-08-06 | Paper |
Stochastic binary problems with simple penalties for capacity constraints violations
Mathematical Programming. Series A. Series B | 2013-05-06 | Paper |
Bilevel programming and price setting problems
4OR | 2013-03-25 | Paper |
Solving large \(p\)-median problems with a radius formulation
INFORMS Journal on Computing | 2012-07-28 | Paper |
A class representative model for pure parsimony haplotyping
INFORMS Journal on Computing | 2012-07-28 | Paper |
A new formulation and resolution method for the \(p\)-center problem
INFORMS Journal on Computing | 2012-06-08 | Paper |
Valid inequalities and branch-and-cut for the clique pricing problem
Discrete Optimization | 2012-03-07 | Paper |
Generalized network design polyhedra
Networks | 2011-11-21 | Paper |
Scheduling two chains of unit jobs on one machine: a polyhedral study
Networks | 2011-11-21 | Paper |
Improved formulations for the ring spur assignment problem
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Reduction approaches for robust shortest path problems
Computers \& Operations Research | 2011-04-28 | Paper |
An exact approach to the problem of extracting an embedded network matrix
Computers \& Operations Research | 2011-04-28 | Paper |
Bilevel programming and price setting problems
Operations Research Proceedings | 2011-04-07 | Paper |
A polyhedral study of the network pricing problem with connected toll arcs
Networks | 2010-11-24 | Paper |
Size-constrained graph partitioning polytopes
Discrete Mathematics | 2010-11-19 | Paper |
A branch-and-cut algorithm for the partitioning-hub location-routing problem
Computers \& Operations Research | 2010-10-15 | Paper |
Generating facets for the independence system polytope
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
The pure parsimony haplotyping problem: overview and computational advances
International Transactions in Operational Research | 2010-05-31 | Paper |
Pricing geometric transportation networks
International Journal of Computational Geometry & Applications | 2010-02-12 | Paper |
Joint Design and Pricing on a Network
Operations Research | 2009-08-13 | Paper |
Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
Networks | 2009-07-28 | Paper |
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
Discrete Optimization | 2009-05-07 | Paper |
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
Networks | 2008-12-17 | Paper |
New formulations and valid inequalities for a bilevel pricing problem
Operations Research Letters | 2008-08-06 | Paper |
Solving haplotyping inference parsimony problem using a new basic polynomial formulation
Computers & Mathematics with Applications | 2008-06-12 | Paper |
A branch-and-cut method for the obnoxious \(p\)-median problem
4OR | 2008-05-20 | Paper |
Optimization models for the single delay management problem in public transportation
European Journal of Operational Research | 2008-04-24 | Paper |
Solving the hub location problem in a star–star network
Networks | 2008-01-08 | Paper |
A strengthened formulation for the simple plant location problem with order
Operations Research Letters | 2007-08-27 | Paper |
Polyhedral approaches to the design of survivable networks
| 2007-07-23 | Paper |
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
Networks | 2007-02-02 | Paper |
Polyhedral analysis for concentrator location problems
Computational Optimization and Applications | 2006-11-17 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
A branch and cut algorithm for hub location problems with single assignment
Mathematical Programming. Series A. Series B | 2005-04-19 | Paper |
A branch-and-cut algorithm for the plant-cycle location problem
The Journal of the Operational Research Society | 2005-04-04 | Paper |
Adapting polyhedral properties from facility to hub location problems
Discrete Applied Mathematics | 2005-01-31 | Paper |
Projecting the flow variables for hub location problems
Networks | 2005-01-12 | Paper |
Locating median cycles in networks
European Journal of Operational Research | 2004-11-22 | Paper |
scientific article; zbMATH DE number 2096638 (Why is no real title available?)
| 2004-09-06 | Paper |
The Ring Star Problem: Polyhedral analysis and exact algorithm
Networks | 2004-08-04 | Paper |
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
Networks | 2004-03-15 | Paper |
Two-connected networks with rings of bounded cardinality
Computational Optimization and Applications | 2004-03-15 | Paper |
Covering a graph with cycles.
Computers \& Operations Research | 2003-09-07 | Paper |
Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
Networks | 2003-08-20 | Paper |
Upper bounds and algorithms for the maximum cardinality bin packing problem.
European Journal of Operational Research | 2003-07-30 | Paper |
Generalized network design problems.
European Journal of Operational Research | 2003-06-09 | Paper |
Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives
Annals of Operations Research | 2003-05-04 | Paper |
Polyhedral results for two-connected networks with bounded rings
Mathematical Programming. Series A. Series B | 2002-12-01 | Paper |
A bilevel model and solution algorithm for a freight tariff-setting problem
Transportation Science | 2002-09-02 | Paper |
Finding Disjoint Routes in Telecommunications Networks with Two Technologies
Operations Research | 2002-08-15 | Paper |
Solving the Two-Connected Network with Bounded Meshes Problem
Operations Research | 2002-06-04 | Paper |
The Uncapacitated Facility Location Problem with Client Matching
Operations Research | 2002-06-04 | Paper |
A bilevel model of taxation and its application to optimal highway pricing
Management Science | 2002-04-17 | Paper |
A comparative analysis of several formulations for the generalized minimum spanning tree problem
Networks | 2002-04-08 | Paper |
scientific article; zbMATH DE number 1453000 (Why is no real title available?)
| 2002-02-05 | Paper |
scientific article; zbMATH DE number 1803762 (Why is no real title available?)
| 2002-01-01 | Paper |
On generalized minimum spanning trees
European Journal of Operational Research | 2001-10-14 | Paper |
Locations on time-varying networks
| 2001-07-09 | Paper |
Two simple algorithms for bin covering
Acta Cybernetica | 2001-04-01 | Paper |
scientific article; zbMATH DE number 1568989 (Why is no real title available?)
| 2001-02-22 | Paper |
A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
Transportation Science | 2001-01-01 | Paper |
Exact solution of the SONET ring loading problem
Operations Research Letters | 2000-01-31 | Paper |
Multicriteria network location problems with sum objectives
| 1999-08-04 | Paper |
scientific article; zbMATH DE number 1253065 (Why is no real title available?)
| 1999-02-22 | Paper |
scientific article; zbMATH DE number 1175956 (Why is no real title available?)
| 1998-07-19 | Paper |
On the Two-Level Uncapacitated Facility Location Problem
INFORMS Journal on Computing | 1997-06-10 | Paper |
scientific article; zbMATH DE number 956792 (Why is no real title available?)
| 1996-12-11 | Paper |
Complexity of spanning tree problems with leaf-dependent objectives
| 1996-08-05 | Paper |
Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem
Operations Research Letters | 1996-08-01 | Paper |
scientific article; zbMATH DE number 849074 (Why is no real title available?)
| 1996-02-28 | Paper |
An exact algorithm for the dual bin packing problem
Operations Research Letters | 1995-06-19 | Paper |
Improved Algorithms for Machine Allocation in Manufacturing Systems
Operations Research | 1995-04-17 | Paper |
The multi-level uncapacitated facility location problem is not submodular
European Journal of Operational Research | 1994-07-26 | Paper |
The multi-level uncapacitated facility location problem is not submodular
European Journal of Operational Research | 1994-04-12 | Paper |
A note on a stochastic location problem
Operations Research Letters | 1994-02-17 | Paper |
Two-dimensional rectangle packing: On-line methods and results
Discrete Applied Mathematics | 1994-01-09 | Paper |
Approximation algorithms for the capacitated plant allocation problem
Operations Research Letters | 1994-01-01 | Paper |
On locating path- or tree-shaped facilities on networks
Networks | 1993-12-12 | Paper |
scientific article; zbMATH DE number 279289 (Why is no real title available?)
| 1993-08-22 | Paper |
The Voronoi Partition of a Network and Its Implications in Location Theory
ORSA Journal on Computing | 1993-02-25 | Paper |
Sensitivity Analysis in Minisum Facility Location Problems
Operations Research | 1992-09-26 | Paper |
scientific article; zbMATH DE number 33203 (Why is no real title available?)
| 1992-06-28 | Paper |
Market and Locational Equilibrium for Two Competitors
Operations Research | 1992-06-28 | Paper |
Capacitated Vehicle Routing on Trees
Operations Research | 1992-06-26 | Paper |
From the median to the generalized center
RAIRO - Operations Research | 1992-06-25 | Paper |
The continuous center set of a network
Discrete Applied Mathematics | 1991-01-01 | Paper |
Commuters' Paths with Penalties for Early or Late Arrival Time
Transportation Science | 1990-01-01 | Paper |
Location of an obnoxious facility on a network: A voting approach
Networks | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4195184 (Why is no real title available?)
| 1990-01-01 | Paper |
The continuousp-median of a network
Networks | 1989-01-01 | Paper |
A tree-network has the fixed point property
Networks | 1989-01-01 | Paper |
Sensitivity analysis in multiple objective linear programming: The tolerance approach
European Journal of Operational Research | 1989-01-01 | Paper |
Competitive Location with Random Utilities
Transportation Science | 1989-01-01 | Paper |
Algorithms for Voting and Competitive Location on a Network
Transportation Science | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4018774 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4003873 (Why is no real title available?)
| 1987-01-01 | Paper |
How bad can a voting locating be
Social Choice and Welfare | 1986-01-01 | Paper |
Outcomes of voting and planning in single facility location problems
European Journal of Operational Research | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3922329 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3835729 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3775235 (Why is no real title available?)
| 1982-01-01 | Paper |
{\lambda}-Cent-Dians and Generalized-Center for Network Design
| N/A | Paper |
