| Optimizing resource utilization in NFV dynamic systems: New exact and heuristic approaches. | 2 | 0.37 | 2019 |
| The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases | 1 | 0.36 | 2019 |
| Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems | 0 | 0.34 | 2019 |
| A compact optimization model for the tail assignment problem. | 0 | 0.34 | 2018 |
| Robust And Stochastic Multistage Optimisation Under Markovian Uncertainty With Applications To Production/Inventory Problems | 2 | 0.38 | 2018 |
| Global probability maximization for a Gaussian bilateral inequality in polynomial time. | 1 | 0.36 | 2017 |
| Reduced-size formulations for metric and cut polyhedra in sparse graphs. | 0 | 0.34 | 2017 |
| Improved linearized models for graph partitioning problem under capacity constraints. | 0 | 0.34 | 2017 |
| Improved compact formulations for a wide class of graph partitioning problems in sparse graphs. | 3 | 0.44 | 2017 |
| A MILP model and heuristic approach for facility location under multiple operational constraints. | 1 | 0.35 | 2016 |
| Convexity of Gaussian chance constraints and of related probability maximization problems | 1 | 0.37 | 2016 |
| Improved compact formulations for metric and cut polyhedra. | 0 | 0.34 | 2016 |
| Stochastic graph partitioning: quadratic versus SOCP formulations | 0 | 0.34 | 2016 |
| Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles. | 1 | 0.36 | 2015 |
| Multi-product valid inequalities for the discrete lot-sizing and scheduling problem. | 0 | 0.34 | 2015 |
| A distribution network design problem in the automotive industry: MIP formulation and heuristics. | 0 | 0.34 | 2014 |
| New Multi-product Valid Inequalities for a Discrete Lot-sizing Problem. | 0 | 0.34 | 2014 |
| Solving to Optimality a Discrete Lot-Sizing Problem Thanks to Multi-product Multi-period Valid Inequalities | 0 | 0.34 | 2014 |
| An evaluation of semidefinite programming based approaches for discrete lot-sizing problems. | 2 | 0.37 | 2014 |
| Compact versus noncompact LP formulations for minimizing convex Choquet integrals | 5 | 0.44 | 2013 |
| On discrete lot-sizing and scheduling on identical parallel machines. | 3 | 0.40 | 2012 |
| A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints | 9 | 0.54 | 2012 |
| Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard. | 0 | 0.34 | 2012 |
| On the solution of a graph partitioning problem under capacity constraints | 5 | 0.50 | 2012 |
| On 2-stage robust LP with RHS uncertainty: complexity results and applications | 18 | 0.99 | 2011 |
| Mixed integer programming model for pricing in telecommunication | 1 | 0.64 | 2011 |
| Optimizing glass coating lines: MIP model and valid inequalities | 0 | 0.34 | 2010 |
| Using DRL* relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut | 0 | 0.34 | 2010 |
| Accelerating Benders Method Using Covering Cut Bundle Generation | 38 | 1.26 | 2010 |
| Robust network optimization under polyhedral demand uncertainty is NP-hard | 18 | 0.84 | 2010 |
| DRL*: A hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs | 3 | 0.45 | 2010 |
| On robust maximum flow with polyhedral uncertainty sets | 19 | 0.94 | 2009 |
| On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times | 5 | 0.45 | 2009 |
| Scheduling of loading and unloading of crude oil in a refinery using event-based discrete time formulation | 27 | 1.36 | 2009 |
| A Strong Flow-Based Formulation For The Shortest Path Problem In Digraphs With Negative Cycles | 8 | 0.62 | 2009 |
| Discrete lot sizing and scheduling using product decomposition into attributes | 5 | 0.49 | 2009 |
| Solving some Multistage Robust Decision Problems with Huge Implicitly Defined Scenario Trees | 7 | 0.59 | 2009 |
| Dioïds and semirings: Links to fuzzy sets and other applications | 19 | 1.18 | 2007 |
| Semirings, Dioids and Their Links to Fuzzy Sets and Other Applications | 0 | 0.34 | 2007 |
| Joint optimization of pricing and resource allocation in competitive telecommunications networks | 4 | 0.56 | 2007 |
| Modeling and solving a Crew Assignment Problem in air transportation | 18 | 0.90 | 2006 |
| Discrete Monotonic Optimization with Application to a Discrete Location Problem | 15 | 1.34 | 2006 |
| Exact MAX-2SAT solution via lift-and-project closure | 5 | 0.45 | 2006 |
| Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation | 18 | 0.85 | 2005 |
| Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems | 4 | 0.45 | 2004 |
| A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem | 12 | 0.61 | 2003 |
| A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems | 13 | 0.75 | 2002 |
| Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods | 20 | 1.01 | 2001 |
| Partgen: A Generator Of Very Large Circuits To Benchmark The Partitioning Of Fpgas | 2 | 0.42 | 2000 |
| Exact solution of multicommodity network optimization problems with general step cost functions | 46 | 3.07 | 1999 |
