Andrea Lodi

Math. Program., January, 2024

Explainable prediction of Qcodes for NOTAMs using column generation.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., January, 2024

One-for-many Counterfactual Explanations by Column Generation.

[BibT_eX]

[DOI]

Jasone Ramírez-Ayerbe

CoRR, 2024

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming.

[BibT_eX]

[DOI]

CoRR, 2024

A Reinforcement Learning Approach for Dynamic Rebalancing in Bike-Sharing System.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Deep Neural Networks Pruning via the Structured Perspective Regularization.

[BibT_eX]

[DOI]

SIAM J. Math. Data Sci., December, 2023

Continuous cutting plane algorithms in integer programming.

[BibT_eX]

[DOI]

Didier Chételat

Oper. Res. Lett., July, 2023

Disjunctive cuts in Mixed-Integer Conic Optimization.

[BibT_eX]

[DOI]

Mathieu Tanneau

Juan Pablo Vielma

Math. Program., May, 2023

Machine-Learning-Based Arc Selection for Constrained Shortest Path Problems in Column Generation.

[BibT_eX]

[DOI]

Mouad Morabit

INFORMS J. Optim., April, 2023

A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs.

[BibT_eX]

[DOI]

Borzou Rostami

Fausto Errico

Oper. Res., March, 2023

Combinatorial Optimization and Reasoning with Graph Neural Networks.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2023

A machine learning framework for neighbor generation in metaheuristic search.

[BibT_eX]

[DOI]

Frontiers Appl. Math. Stat., 2023

A theoretical and computational equilibria analysis of a multi-player kidney exchange program.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2023

Revisiting column-generation-based matheuristic for learning classification trees.

[BibT_eX]

[DOI]

Krunal Kishor Patel

CoRR, 2023

Structured Pruning of Neural Networks for Constraints Learning.

[BibT_eX]

[DOI]

Matteo Cacciola

Antonio Frangioni

CoRR, 2023

Integer Programming Games: A Gentle Computational Overview.

[BibT_eX]

[DOI]

Gabriele Dragotto

CoRR, 2023

The Critical Node Game.

[BibT_eX]

[DOI]

CoRR, 2023

Capacity Planning in Stable Matching: An Application to School Choice.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill?

[BibT_eX]

[DOI]

Ítalo Santana

Thibaut Vidal

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

Optimizing Fairness over Time with Homogeneous Workers (Short Paper).

[BibT_eX]

[DOI]

Bart van Rossum

Rui Chen

Proceedings of the 23rd Symposium on Algorithmic Approaches for Transportation Modelling, 2023

2022

A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX.

[BibT_eX]

[DOI]

Pierre Bonami

Giulia Zarpellon

Oper. Res., November, 2022

Data-Driven Combinatorial Optimisation (Dagstuhl Seminar 22431).

[BibT_eX]

[DOI]

Dagstuhl Reports, October, 2022

Lookback for Learning to Branch.

[BibT_eX]

[DOI]

Trans. Mach. Learn. Res., 2022

Cutting Plane Generation through Sparse Principal Component Analysis.

[BibT_eX]

[DOI]

Santanu S. Dey

Aleksandr M. Kazachkov

Gonzalo Muñoz

SIAM J. Optim., 2022

Guidelines for the computational testing of machine learning approaches to vehicle routing problems.

[BibT_eX]

[DOI]

Luca Accorsi

Oper. Res. Lett., 2022

The promise of machine learning applications in solid organ transplantation.

[BibT_eX]

[DOI]

npj Digit. Medicine, 2022

On generalized surrogate duality in mixed-integer nonlinear programming.

[BibT_eX]

[DOI]

Math. Program., 2022

Nonlinear chance-constrained problems with applications to hydro scheduling.

[BibT_eX]

[DOI]

Math. Program., 2022

Single Allocation Hub Location with Heterogeneous Economies of Scale.

[BibT_eX]

[DOI]

Oper. Res., 2022

Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2022

On the Estimation of Discrete Choice Models to Capture Irrational Customer Behaviors.

[BibT_eX]

[DOI]

Sanjay Dominik Jena

Claudio Sole

INFORMS J. Comput., 2022

JANOS: An Integrated Predictive and Prescriptive Modeling Framework.

[BibT_eX]

[DOI]

Arvind U. Raghunathan

INFORMS J. Comput., 2022

Heuristics for optimizing 3D mapping missions over swarm-powered ad-hoc clouds.

[BibT_eX]

[DOI]

Leandro Rincon Costa

Daniel Aloise

Luca Giovanni Gianoli

J. Heuristics, 2022

Computing equilibria for integer programming games.

[BibT_eX]

[DOI]

João Pedro Pedroso

Eur. J. Oper. Res., 2022

BDD-based optimization for the quadratic stable set problem.

[BibT_eX]

[DOI]

Jaime E. González

André A. Ciré

Discret. Optim., 2022

Learning to repeatedly solve routing problems.

[BibT_eX]

[DOI]

Mouad Morabit

CoRR, 2022

Connectivity-constrained Interactive Panoptic Segmentation.

[BibT_eX]

[DOI]

CoRR, 2022

A Simple Algorithm for Online Decision Making.

[BibT_eX]

[DOI]

CoRR, 2022

A Stochastic Proximal Method for Nonsmooth Regularized Finite Sum Optimization.

[BibT_eX]

[DOI]

Dounia Lakhmiri

Dominique Orban

CoRR, 2022

Capacity Variation in the Many-to-one Stable Matching.

[BibT_eX]

[DOI]

CoRR, 2022

Fast Continuous and Integer L-shaped Heuristics Through Supervised Learning.

[BibT_eX]

[DOI]

CoRR, 2022

The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights.

[BibT_eX]

[DOI]

CoRR, 2022

Measures of balance in combinatorial optimization.

[BibT_eX]

[DOI]

4OR, 2022

Learning to Branch with Tree MDPs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Learning to Compare Nodes in Branch and Bound with Graph Neural Networks.

[BibT_eX]

[DOI]

Abdel Ghani Labassi

Didier Chételat

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

OptiMaP: swarm-powered Optimized 3D Mapping Pipeline for emergency response operations.

[BibT_eX]

[DOI]

Leandro Rincon Costa

Daniel Aloise

Luca Giovanni Gianoli

Proceedings of the 18th International Conference on Distributed Computing in Sensor Systems, 2022

A Learning Metaheuristic Algorithm for a Scheduling Application.

[BibT_eX]

[DOI]

Nazgol Niroumandrad

Nadia Lahrichi

Proceedings of the Metaheuristics - 14th International Conference, 2022

Predicting Waiting Time and Quality of Kidney Offers for Kidney Transplant Candidates.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence in Medicine, 2022

Learning to Search in Local Branching.

[BibT_eX]

[DOI]

Defeng Liu

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

MIP-GNN: A Data-Driven Framework for Guiding Combinatorial Solvers.

[BibT_eX]

[DOI]

Elias B. Khalil

Christopher Morris

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Machine-Learning-Based Column Selection for Column Generation.

[BibT_eX]

[DOI]

Mouad Morabit

Transp. Sci., 2021

An Exact Algorithmic Framework for a Class of Mixed-Integer Programs with Equilibrium Constraints.

[BibT_eX]

[DOI]

Teodora Dan

Patrice Marcotte

SIAM J. Optim., 2021

Lattice Reformulation Cuts.

[BibT_eX]

[DOI]

SIAM J. Optim., 2021

A note on the Lasserre hierarchy for different formulations of the maximum independent set problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

Design and implementation of a modular interior-point solver for linear optimization.

[BibT_eX]

[DOI]

Mathieu Tanneau

Miguel F. Anjos

Math. Program. Comput., 2021

Learning chordal extensions.

[BibT_eX]

[DOI]

Defeng Liu

Mathieu Tanneau

J. Glob. Optim., 2021

The Covering-Assignment Problem for Swarm-Powered Ad Hoc Clouds: A Distributed 3-D Mapping Usecase.

[BibT_eX]

[DOI]

Leandro Rincon Costa

Daniel Aloise

Luca Giovanni Gianoli

IEEE Internet Things J., 2021

Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times.

[BibT_eX]

[DOI]

Oper. Res., 2021

Multilevel Approaches for the Critical Node Problem.

[BibT_eX]

[DOI]

Oper. Res., 2021

The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2021

Tabu search for the time-dependent vehicle routing problem with time windows on a road network.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2021

Machine learning for combinatorial optimization: A methodological tour d'horizon.

[BibT_eX]

[DOI]

Yoshua Bengio

Tiphaine Bonniot de Ruisselet

Antoine Prouvost

Eur. J. Oper. Res., 2021

Adaptive First- and Second-Order Algorithms for Large-Scale Machine Learning.

[BibT_eX]

[DOI]

Sanae Lotfi

Dominique Orban

CoRR, 2021

ZERO: Playing Mathematical Programming Games.

[BibT_eX]

[DOI]

Gabriele Dragotto

CoRR, 2021

The Cut and Play Algorithm: Computing Nash Equilibria via Outer Approximations.

[BibT_eX]

[DOI]

Gabriele Dragotto

CoRR, 2021

Capacity Expansion in the College Admission Problem.

[BibT_eX]

[DOI]

CoRR, 2021

Cardinality Minimization, Constraints, and Regularization: A Survey.

[BibT_eX]

[DOI]

CoRR, 2021

Ecole: A Library for Learning Inside MILP Solvers.

[BibT_eX]

[DOI]

CoRR, 2021

Predicting the probability distribution of bus travel time to move towards reliable planning of public transport services.

[BibT_eX]

[DOI]

Léa Ricard

CoRR, 2021

Can Machine Learning Help in Solving Cargo Capacity Management Booking Control Problems?

[BibT_eX]

[DOI]

Justin Dumouchelle

Emma Frejinger

CoRR, 2021

Estimating the Impact of an Improvement to a Revenue Management System: An Airline Application.

[BibT_eX]

[DOI]

CoRR, 2021

Exploring the Wasserstein metric for time-to-event analysis.

[BibT_eX]

[DOI]

Proceedings of AAAI Symposium on Survival Prediction, 2021

The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights.

[BibT_eX]

[DOI]

Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track, 2021

Learning to Schedule Heuristics in Branch and Bound.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Learning in Local Branching (Invited Talk).

[BibT_eX]

[DOI]

Defeng Liu

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Reinforcement Learning Based Penetration Testing of a Microgrid Control Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 11th IEEE Annual Computing and Communication Workshop and Conference, 2021

Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

A Partially Ranked Choice Model for Large-Scale Data-Driven Assortment Optimization.

[BibT_eX]

[DOI]

INFORMS J. Optim., October, 2020

An ILP Model for Multi-Label MRFs With Connectivity Constraints.

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 2020

Preface to the special issue of INFOR on "continuous optimization and applications in machine learning and data analytics".

[BibT_eX]

[DOI]

INFOR Inf. Syst. Oper. Res., 2020

A multicut outer-approximation approach for competitive facility location under random utilities.

[BibT_eX]

[DOI]

Tien Mai

Eur. J. Oper. Res., 2020

Travel speed prediction based on learning methods for home delivery.

[BibT_eX]

[DOI]

EURO J. Transp. Logist., 2020

Learning to handle parameter perturbations in Combinatorial Optimization: An application to facility location.

[BibT_eX]

[DOI]

Luca Mossina

Emmanuel Rachelson

EURO J. Transp. Logist., 2020

Joint location and pricing within a user-optimized environment.

[BibT_eX]

[DOI]

Teodora Dan

Patrice Marcotte

EURO J. Comput. Optim., 2020

Computing Nash equilibria for integer programming games.

[BibT_eX]

[DOI]

Tiphaine Bonniot de Ruisselet

João Pedro Pedroso

CoRR, 2020

Stochastic Damped L-BFGS with Controlled Norm of the Hessian Approximation.

[BibT_eX]

[DOI]

Sanae Lotfi

Dominique Orban

CoRR, 2020

Ecole: A Gym-like Library for Machine Learning in Combinatorial Optimization Solvers.

[BibT_eX]

[DOI]

CoRR, 2020

Change Point Detection by Cross-Entropy Maximization.

[BibT_eX]

[DOI]

Aurélien Serre

Didier Chételat

CoRR, 2020

Hybrid Models for Learning to Branch.

[BibT_eX]

[DOI]

CoRR, 2020

Provable Guarantees for General Two-sided Sequential Matching Markets.

[BibT_eX]

[DOI]

Alfredo Torrico

CoRR, 2020

Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem.

[BibT_eX]

[DOI]

Jaime E. González

André Augusto Ciré

Constraints An Int. J., 2020

Hybrid Models for Learning to Branch.

[BibT_eX]

[DOI]

Prateek Gupta

Maxime Gasse

Elias B. Khalil

Pawan Kumar Mudigonda

Yoshua Bengio

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Activation Adaptation in Neural Networks.

[BibT_eX]

[DOI]

Farnoush Farhadi

Vahid Partovi Nia

Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods, 2020

A Learning-Based Algorithm to Quickly Compute Good Primal Solutions for Stochastic Integer Programs.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

Analyzing the Resiliency of Microgrid Control Algorithms Against Malicious Input.

[BibT_eX]

[DOI]

Proceedings of the IEEE Canadian Conference on Electrical and Computer Engineering, 2020

2019

Solving Quadratic Programming by Cutting Planes.

[BibT_eX]

[DOI]

SIAM J. Optim., 2019

QPLIB: a library of quadratic programming instances.

[BibT_eX]

[DOI]

Nikolaos V. Sahinidis

Stefan Vigerske

Angelika Wiegele

Math. Program. Comput., 2019

Ten years of feasibility pump, and counting.

[BibT_eX]

[DOI]

Timo Berthold

Domenico Salvagnin

EURO J. Comput. Optim., 2019

Game theoretical analysis of Kidney Exchange Programs.

[BibT_eX]

[DOI]

CoRR, 2019

Nash Games Among Stackelberg Leaders.

[BibT_eX]

[DOI]

CoRR, 2019

Exact Combinatorial Optimization with Graph Convolutional Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Learning MILP Resolution Outcomes Before Reaching Time-Limit.

[BibT_eX]

[DOI]

Martina Fischetti

Giulia Zarpellon

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems.

[BibT_eX]

[DOI]

Pierre Coste

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

2018

Exact Solutions for the Carrier-Vehicle Traveling Salesman Problem.

[BibT_eX]

[DOI]

Claudio Gambella

Transp. Sci., 2018

A polynomial algorithm for a continuous bilevel knapsack problem.

[BibT_eX]

[DOI]

Patrice Marcotte

Oper. Res. Lett., 2018

Experiments on virtual private network design with concave capacity costs.

[BibT_eX]

[DOI]

Melchiorre Danilo Abrignani

Ahmad Moradi

Optim. Lett., 2018

Scheduling M2M traffic over LTE uplink of a dense small cell network.

[BibT_eX]

[DOI]

Lorenza Giupponi

Roberto Verdone

EURASIP J. Wirel. Commun. Netw., 2018

Predicting Solution Summaries to Integer Linear Programs under Imperfect Information with Machine Learning.

[BibT_eX]

[DOI]

CoRR, 2018

Learning to rank for censored survival data.

[BibT_eX]

[DOI]

CoRR, 2018

A Comparison of Optimization Methods for Multi-objective Constrained Bin Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

Learning a Classification of Mixed-Integer Quadratic Programming Problems.

[BibT_eX]

[DOI]

Pierre Bonami

Giulia Zarpellon

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

2017

Integral simplex using decomposition with primal cutting planes.

[BibT_eX]

[DOI]

Math. Program., 2017

Nash equilibria in the two-player kidney exchange game.

[BibT_eX]

[DOI]

Math. Program., 2017

Special issue on: Nonlinear and combinatorial methods for energy optimization.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2017

Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints.

[BibT_eX]

[DOI]

Enrico Pietrobuoni

Discret. Appl. Math., 2017

An ILP Solver for Multi-label MRFS with Connectivity Constraints.

[BibT_eX]

[DOI]

CoRR, 2017

Deep Learning for Patient-Specific Kidney Graft Survival Analysis.

[BibT_eX]

[DOI]

CoRR, 2017

Cutting Planes from Wide Split Disjunctions.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016

Improving branch-and-cut performance by random sampling.

[BibT_eX]

[DOI]

Math. Program. Comput., 2016

Single-commodity robust network design with finite and Hose demand sets.

[BibT_eX]

[DOI]

Math. Program., 2016

Design and Control of Public-Service Contracts and an Application to Public Transportation Systems.

[BibT_eX]

[DOI]

Luis Eduardo Neves Gouveia

Enrico Malaguti

Nicolás E. Stier Moses

Tommaso Bonino

Manag. Sci., 2016

Bilevel Knapsack with Interdiction Constraints.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2016

Preface.

[BibT_eX]

[DOI]

Ali Ridha Mahjoub

Discret. Optim., 2016

On handling indicator constraints in mixed integer programming.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2016

2015

Virtual private network design over the first Chvátal closure.

[BibT_eX]

[DOI]

Ahmad Moradi

S. Mehdi Hashemi

RAIRO Oper. Res., 2015

On mathematical programming with indicator constraints.

[BibT_eX]

[DOI]

Math. Program., 2015

Erratum to "Mathematical programming techniques in water network optimization" [Eur. J. Oper. Res. 243(2015) 774-788].

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

Mathematical programming techniques in water network optimization.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

Scheduling M2M traffic over LTE uplink of a dense small cells network.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Symposium on Wireless Communication Systems (ISWCS), 2015

2014

Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2014

Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2014

A Study on the Computational Complexity of the Bilevel Knapsack Problem.

[BibT_eX]

[DOI]

SIAM J. Optim., 2014

On the difficulty of virtual private network instances.

[BibT_eX]

[DOI]

Ahmad Moradi

S. Mehdi Hashemi

Networks, 2014

Bilevel programming and the separation problem.

[BibT_eX]

[DOI]

Ted K. Ralphs

Gerhard J. Woeginger

Math. Program., 2014

On the Practical Strength of Two-Row Tableau Cuts.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2014

Optimistic MILP modeling of non-linear optimization problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Single-commodity robust network design problem: Complexity, instances and heuristic solutions.

[BibT_eX]

[DOI]

Eduardo Álvarez-Miranda

Eur. J. Oper. Res., 2014

Integral Simplex Using Decomposition with Primal Cuts.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Optimum: Thermal-aware task allocation for heterogeneous many-core devices.

[BibT_eX]

[DOI]

Proceedings of the International Conference on High Performance Computing & Simulation, 2014

Tactical Versus Operational Discrete Event Simulation: A Breast Screening Case Study.

[BibT_eX]

[DOI]

Proceedings of the 28th European Conference on Modelling and Simulation, 2014

2013

The Heuristic (Dark) Side of MIP Solvers.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Metaheuristics, 2013

Test-assignment: a quadratic coloring problem.

[BibT_eX]

[DOI]

Jelle Duives

Enrico Malaguti

J. Heuristics, 2013

Mixed integer nonlinear programming tools: an updated practical overview.

[BibT_eX]

[DOI]

Claudia D'Ambrosio

Ann. Oper. Res., 2013

A Complexity and Approximability Study of the Bilevel Knapsack Problem.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

Complexity and approximation of an area packing problem.

[BibT_eX]

[DOI]

Optim. Lett., 2012

A storm of feasibility pumps for nonconvex MINLP.

[BibT_eX]

[DOI]

Math. Program., 2012

An effective branch-and-bound algorithm for convex quadratic integer programming.

[BibT_eX]

[DOI]

Christoph Buchheim

Math. Program., 2012

A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2012

Bounding, filtering and diversification in CP-based local branching.

[BibT_eX]

[DOI]

J. Heuristics, 2012

Exact algorithms for the two-dimensional guillotine knapsack.

[BibT_eX]

[DOI]

Mohammad Dolatabadi

Comput. Oper. Res., 2012

Models and Algorithms for Robust Network Design with Several Traffic Scenarios.

[BibT_eX]

[DOI]

Eduardo Álvarez-Miranda

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

MIPLIB 2010.

[BibT_eX]

[DOI]

Math. Program. Comput., 2011

Computing compatible tours for the symmetric traveling salesman problem.

[BibT_eX]

[DOI]

Math. Program. Comput., 2011

On the separation of disjunctive cuts.

[BibT_eX]

[DOI]

Andrea Tramontani

Math. Program., 2011

Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX.

[BibT_eX]

[DOI]

Manag. Sci., 2011

Improving spectral bounds for clustering problems by Lagrangian relaxation.

[BibT_eX]

[DOI]

Mohammad Dolatabadi

Zahra Afsharnejad

Int. Trans. Oper. Res., 2011

A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC.

[BibT_eX]

[DOI]

Comput. Networks, 2011

Mixed integer nonlinear programming tools: a practical overview.

[BibT_eX]

[DOI]

Claudia D'Ambrosio

4OR, 2011

On Counting Lattice Points and Chvátal-Gomory Cutting Planes.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

On Bilevel Programming and Its Impact in Branching, Cutting and Complexity.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

2010

Just MIP it!

[BibT_eX]

[DOI]

Domenico Salvagnin

Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010

Piecewise linear approximation of functions of two variables in MILP models.

[BibT_eX]

[DOI]

Claudia D'Ambrosio

Oper. Res. Lett., 2010

On interval-subgradient and no-good cuts.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

Efficient and fair routing for mesh networks.

[BibT_eX]

[DOI]

Enrico Malaguti

Nicolás E. Stier Moses

Math. Program., 2010

Erratum to: MIR closures of polyhedral sets.

[BibT_eX]

[DOI]

Sanjeeb Dash

Oktay Günlük

Math. Program., 2010

MIR closures of polyhedral sets.

[BibT_eX]

[DOI]

Sanjeeb Dash

Oktay Günlük

Math. Program., 2010

On the knapsack closure of 0-1 Integer Linear Programs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

An approximation scheme for the two-stage, two-dimensional knapsack problem.

[BibT_eX]

[DOI]

Discret. Optim., 2010

Experiments with a Feasibility Pump Approach for Nonconvex MINLPs.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Experiments with Two Row Tableau Cuts.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Practical Solution of Periodic Filtered Approximation as a Convex Quadratic Integer Program.

[BibT_eX]

[DOI]

Proceedings of the Complex Systems Design & Management, 2010

Mixed Integer Programming Computation.

[BibT_eX]

[DOI]

Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009

A Feasibility Pump for mixed integer nonlinear programs.

[BibT_eX]

[DOI]

Math. Program., 2009

Bilevel Programming and Maximally Violated Valid Inequalities.

[BibT_eX]

[DOI]

Ted K. Ralphs

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Projected Chvátal-Gomory cuts for mixed integer linear programs.

[BibT_eX]

[DOI]

Math. Program., 2008

Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities.

[BibT_eX]

[DOI]

Retsef Levi

Maxim Sviridenko

Math. Oper. Res., 2008

An algorithmic framework for convex mixed integer nonlinear programs.

[BibT_eX]

[DOI]

Discret. Optim., 2008

Repairing MIP infeasibility through local branching.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2008

2007

Optimizing over the first Chvátal closure.

[BibT_eX]

[DOI]

Math. Program., 2007

MIPping Closures: An Instant Survey.

[BibT_eX]

[DOI]

Graphs Comb., 2007

A feasibility pump heuristic for general mixed-integer problems.

[BibT_eX]

[DOI]

Livio Bertacco

Discret. Optim., 2007

The traveling salesman problem: a book review.

[BibT_eX]

[DOI]

4OR, 2007

An optimization problem in the electricity market.

[BibT_eX]

[DOI]

4OR, 2007

Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities.

[BibT_eX]

[DOI]

Retsef Levi

Maxim Sviridenko

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

On the MIR Closure of Polyhedra.

[BibT_eX]

[DOI]

Sanjeeb Dash

Oktay Günlük

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

CP-Based Local Branching.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2007

2006

Polynomial-Time Separation of a Superclass of Simple Comb Inequalities.

[BibT_eX]

[DOI]

Lisa Fleischer

Math. Oper. Res., 2006

Discrepancy-Based Additive Bounding Procedures.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2006

Packing into the smallest square: Worst-case analysis of lower bounds.

[BibT_eX]

[DOI]

Discret. Optim., 2006

An MINLP Solution Method for a Water Network Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

2005

New approaches for optimizing over the semimetric polytope.

[BibT_eX]

[DOI]

Antonio Frangioni

Giovanni Rinaldi

Math. Program., 2005

The feasibility pump.

[BibT_eX]

[DOI]

Fred W. Glover

Math. Program., 2005

Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing.

[BibT_eX]

[DOI]

Math. Oper. Res., 2005

A Tale of Two Dimensional Bin Packing.

[BibT_eX]

[DOI]

Nikhil Bansal

Maxim Sviridenko

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

On <i>d</i>-threshold graphs and <i>d</i>-dimensional bin packing.

[BibT_eX]

[DOI]

Romeo Rizzi

Networks, 2004

Models and Bounds for Two-Dimensional Level Packing Problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2004

TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2004

Optimizing over Semimetric Polytopes.

[BibT_eX]

[DOI]

Antonio Frangioni

Giovanni Rinaldi

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003

Integer linear programming models for 2-staged two-dimensional Knapsack problems.

[BibT_eX]

[DOI]

Math. Program., 2003

Local branching.

[BibT_eX]

[DOI]

Math. Program., 2003

Primal separation algorithms.

[BibT_eX]

[DOI]

4OR, 2003

Discrepancy-Based Additive Bounding for the AllDifferent Constraint.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2003

Local Search and Constraint Programming.

[BibT_eX]

[DOI]

François Laburthe

Proceedings of the Handbook of Metaheuristics, 2003

2002

Multi-Dimensional Packing by Tabu Search.

[BibT_eX]

[DOI]

Stud. Inform. Univ., 2002

Strengthening Chvátal-Gomory cuts and Gomory fractional cuts.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2002

Primal cutting plane algorithms revisited.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2002

A Hybrid Exact Algorithm for the TSPTW.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2002

Mathematical Programming Techniques in Constraint Programming: A Short Overview.

[BibT_eX]

[DOI]

J. Heuristics, 2002

Heuristic algorithms for the three-dimensional bin packing problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2002

Two-dimensional packing problems: A survey.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2002

Recent advances on two-dimensional bin packing problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Optimization-Oriented Global Constraints.

[BibT_eX]

[DOI]

Constraints An Int. J., 2002

Embedding Relaxations in Global Constraints for Solving TSP and TSPTW.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2002

Polynomial-Time Separation of Simple Comb Inequalities.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001

A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems.

[BibT_eX]

[DOI]

Manag. Sci., 2001

Efficient algorithms and codes for k-cardinality assignment problems.

[BibT_eX]

[DOI]

Mauro Dell'Amico

Discret. Appl. Math., 2001

An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization, 2001

Solving Real-World ATSP Instances by Branch-and-Cut.

[BibT_eX]

[DOI]

Paolo Toth

Proceedings of the Combinatorial Optimization, 2001

2000

Exact and heuristic algorithms for data sets reconstruction.

[BibT_eX]

[DOI]

Cinzia Zannoni

Eur. J. Oper. Res., 2000

Cutting Planes in Constraint Programming: A Hybrid Approach.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2000

1999

Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1999

Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method.

[BibT_eX]

[DOI]

Mauro Dell'Amico

Francesco Maffioli

J. Heuristics, 1999

Approximation algorithms for the oriented two-dimensional bin packing problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1999

An evolutionary heuristic for quadratic 0-1 programming.

[BibT_eX]

[DOI]

Kim Allemand

Thomas M. Liebling

Eur. J. Oper. Res., 1999

Solving TSP through the Integration of OR and CP Techniques.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

Soving TSP with Time Windows with Constraints.

[BibT_eX]

Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

Cost-Based Domain Filtering.

[BibT_eX]

[DOI]