| Publication | Date of Publication | Type |
|---|
The critical node game
Journal of Combinatorial Optimization | 2024-11-28 | Paper |
Optimizing fairness over time with homogeneous workers (short paper)
| 2024-08-22 | Paper |
Cardinality minimization, constraints, and regularization: a survey
SIAM Review | 2024-08-09 | Paper |
An exact method for (constrained) assortment optimization problems with product costs
INFORMS Journal on Computing | 2024-07-29 | Paper |
An improved column-generation-based matheuristic for learning classification trees
Computers \& Operations Research | 2024-06-25 | Paper |
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
Mathematical Programming. Series A. Series B | 2024-04-09 | Paper |
Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning
INFORMS Journal on Computing | 2024-03-26 | Paper |
Learning to repeatedly solve routing problems
Networks | 2024-03-15 | Paper |
A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs
Operations Research | 2024-03-12 | Paper |
Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities
INFORMS Journal on Computing | 2024-02-27 | Paper |
Fairness over time in dynamic resource allocation with an application in healthcare
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Deep Neural Networks Pruning via the Structured Perspective Regularization
SIAM Journal on Mathematics of Data Science | 2024-01-11 | Paper |
A New Branching Rule for Range Minimization Problems
| 2023-11-07 | Paper |
Neural networks for local search and crossover in vehicle routing: a possible overkill?
Integration of Constraint Programming, Artificial Intelligence, and Operations Research | 2023-10-04 | Paper |
Continuous cutting plane algorithms in integer programming
Operations Research Letters | 2023-09-12 | Paper |
Disjunctive cuts in mixed-integer conic optimization
Mathematical Programming. Series A. Series B | 2023-05-02 | Paper |
Recovering Dantzig-Wolfe Bounds by Cutting Planes
| 2023-01-30 | Paper |
A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
Operations Research | 2023-01-10 | Paper |
A learning-based algorithm to quickly compute good primal solutions for stochastic integer programs
| 2022-12-21 | Paper |
A Framework for Fair Decision-making Over Time with Time-invariant Utilities
| 2022-12-20 | Paper |
A theoretical and computational equilibria analysis of a multi-player kidney exchange program
European Journal of Operational Research | 2022-10-17 | Paper |
On generalized surrogate duality in mixed-integer nonlinear programming
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
An ILP Model for Multi-Label MRFs With Connectivity Constraints
IEEE Transactions on Image Processing | 2022-09-16 | Paper |
Measures of balance in combinatorial optimization
4OR | 2022-08-26 | Paper |
Computing equilibria for integer programming games
European Journal of Operational Research | 2022-08-03 | Paper |
On the Estimation of Discrete Choice Models to Capture Irrational Customer Behaviors
INFORMS Journal on Computing | 2022-07-01 | Paper |
Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information
INFORMS Journal on Computing | 2022-06-28 | Paper |
The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints
INFORMS Journal on Computing | 2022-06-27 | Paper |
Cutting plane generation through sparse principal component analysis
SIAM Journal on Optimization | 2022-06-17 | Paper |
BDD-based optimization for the quadratic stable set problem
Discrete Optimization | 2022-06-09 | Paper |
Single allocation hub location with heterogeneous economies of scale
Operations Research | 2022-05-31 | Paper |
Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound
Optimization and Engineering | 2022-04-22 | Paper |
Nonlinear chance-constrained problems with applications to hydro scheduling
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
On generalized surrogate duality in mixed-integer nonlinear programming
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Guidelines for the computational testing of machine learning approaches to vehicle routing problems
Operations Research Letters | 2022-03-11 | Paper |
Design and implementation of a modular interior-point solver for linear optimization
Mathematical Programming Computation | 2021-12-27 | Paper |
Lattice reformulation cuts
SIAM Journal on Optimization | 2021-11-05 | Paper |
On the estimation of discrete choice models to capture irrational customer behaviors
| 2021-09-08 | Paper |
An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs
| 2021-09-07 | Paper |
Learning chordal extensions
Journal of Global Optimization | 2021-08-17 | Paper |
Multilevel approaches for the critical node problem
Operations Research | 2021-06-17 | Paper |
Branch-price-and-cut algorithms for the vehicle routing problem with stochastic and correlated travel times
Operations Research | 2021-06-17 | Paper |
Tabu search for the time-dependent vehicle routing problem with time windows on a road network
European Journal of Operational Research | 2021-06-03 | Paper |
Machine learning for combinatorial optimization: a methodological tour d'horizon
European Journal of Operational Research | 2021-06-03 | Paper |
An exact algorithmic framework for a class of mixed-integer programs with equilibrium constraints
SIAM Journal on Optimization | 2021-02-02 | Paper |
Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
Constraints | 2020-08-28 | Paper |
A multicut outer-approximation approach for competitive facility location under random utilities
European Journal of Operational Research | 2020-05-07 | Paper |
Joint location and pricing within a user-optimized environment
EURO Journal on Computational Optimization | 2020-03-25 | Paper |
QPLIB: a library of quadratic programming instances
Mathematical Programming Computation | 2019-12-19 | Paper |
A learning-based algorithm to quickly compute good primal solutions for Stochastic Integer Programs
| 2019-12-17 | Paper |
Ten years of feasibility pump, and counting
EURO Journal on Computational Optimization | 2019-10-18 | Paper |
Learning MILP resolution outcomes before reaching time-limit
| 2019-10-14 | Paper |
Using cost-based solution densities from TSP relaxations to solve routing problems
| 2019-10-14 | Paper |
A polynomial algorithm for a continuous bilevel knapsack problem
Operations Research Letters | 2019-06-11 | Paper |
Solving Quadratic Programming by Cutting Planes
SIAM Journal on Optimization | 2019-05-07 | Paper |
Learning a classification of mixed-integer quadratic programming problems
| 2018-11-21 | Paper |
A comparison of optimization methods for multi-objective constrained bin packing problems
| 2018-11-21 | Paper |
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Experiments on virtual private network design with concave capacity costs
Optimization Letters | 2018-07-31 | Paper |
On the difficulty of virtual private network instances
Networks | 2018-05-23 | Paper |
Integral simplex using decomposition with primal cutting planes
Mathematical Programming. Series A. Series B | 2017-12-01 | Paper |
Rejoinder on: ``On learning and branching: a survey
Top | 2017-10-12 | Paper |
On learning and branching: a survey
Top | 2017-10-12 | Paper |
Cutting planes from wide split disjunctions
| 2017-08-31 | Paper |
Bounding, filtering and diversification in CP-based local branching
Journal of Heuristics | 2017-04-04 | Paper |
On the practical strength of two-row tableau cuts
INFORMS Journal on Computing | 2017-02-17 | Paper |
Nash equilibria in the two-player kidney exchange game
Mathematical Programming. Series A. Series B | 2017-02-03 | Paper |
Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
Discrete Applied Mathematics | 2016-12-22 | Paper |
On handling indicator constraints in mixed integer programming
Computational Optimization and Applications | 2016-12-15 | Paper |
Mathematical programming techniques in water network optimization
European Journal of Operational Research | 2016-10-06 | Paper |
Erratum to ``Mathematical programming techniques in water network optimization
European Journal of Operational Research | 2016-10-06 | Paper |
Bilevel knapsack with interdiction constraints
INFORMS Journal on Computing | 2016-08-12 | Paper |
A time bucket formulation for the traveling salesman problem with time windows
INFORMS Journal on Computing | 2016-06-29 | Paper |
Optimistic MILP modeling of non-linear optimization problems
European Journal of Operational Research | 2016-06-24 | Paper |
Single-commodity robust network design problem: complexity, instances and heuristic solutions
European Journal of Operational Research | 2016-06-23 | Paper |
Single-commodity robust network design with finite and hose demand sets
Mathematical Programming. Series A. Series B | 2016-06-06 | Paper |
Improving branch-and-cut performance by random sampling
Mathematical Programming Computation | 2016-04-13 | Paper |
Virtual private network design over the first Chvátal closure
RAIRO - Operations Research | 2015-08-14 | Paper |
On mathematical programming with indicator constraints
Mathematical Programming. Series A. Series B | 2015-06-19 | Paper |
A study on the computational complexity of the bilevel knapsack problem
SIAM Journal on Optimization | 2014-09-26 | Paper |
Bilevel programming and the separation problem
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
On the optimal design of water distribution networks: a practical MINLP approach
Optimization and Engineering | 2014-08-20 | Paper |
On the knapsack closure of 0-1 integer linear programs
| 2013-11-08 | Paper |
Mixed integer nonlinear programming tools: an updated practical overview
Annals of Operations Research | 2013-08-08 | Paper |
Improving spectral bounds for clustering problems by Lagrangian relaxation
International Transactions in Operational Research | 2013-04-24 | Paper |
A complexity and approximability study of the bilevel knapsack problem
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
A storm of feasibility pumps for nonconvex MINLP
Mathematical Programming. Series A. Series B | 2012-12-19 | Paper |
Complexity and approximation of an area packing problem
Optimization Letters | 2012-11-30 | Paper |
Exact algorithms for the two-dimensional guillotine knapsack
Computers \& Operations Research | 2012-11-15 | Paper |
Models and algorithms for robust network design with several traffic scenarios
Lecture Notes in Computer Science | 2012-11-02 | Paper |
An effective branch-and-bound algorithm for convex quadratic integer programming
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
An approximation scheme for the two-stage, two-dimensional knapsack problem
Discrete Optimization | 2012-06-20 | Paper |
Discrepancy-based additive bounding procedures
INFORMS Journal on Computing | 2012-06-18 | Paper |
A hybrid exact algorithm for the TSPTW
INFORMS Journal on Computing | 2012-05-30 | Paper |
Mixed integer nonlinear programming tools: a practical overview
4OR | 2012-03-23 | Paper |
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
Management Science | 2012-02-19 | Paper |
Disjunctive cuts for mixed integer nonlinear programming problems
| 2012-01-26 | Paper |
On the separation of disjunctive cuts
Mathematical Programming. Series A. Series B | 2011-06-17 | Paper |
Computing compatible tours for the symmetric traveling salesman problem
Mathematical Programming Computation | 2011-06-08 | Paper |
On counting lattice points and Chvátal-Gomory cutting planes
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2011-05-26 | Paper |
On bilevel programming and its impact in branching, cutting and complexity. (Abstract)
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2011-05-26 | Paper |
Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities
Mathematics of Operations Research | 2011-04-27 | Paper |
Hybrid Solving Techniques
Hybrid Optimization | 2010-12-22 | Paper |
On interval-subgradient and no-good cuts
Operations Research Letters | 2010-12-20 | Paper |
Two-dimensional bin packing problems
| 2010-12-08 | Paper |
Efficient and fair routing for mesh networks
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Experiments with two row tableau cuts
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
An effective branch-and-bound algorithm for convex quadratic integer programming
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Mixed integer programming computation
50 Years of Integer Programming 1958-2008 | 2010-06-03 | Paper |
Erratum to: MIR closures of polyhedral sets
Mathematical Programming. Series A. Series B | 2010-04-15 | Paper |
Piecewise linear approximation of functions of two variables in MILP models
Operations Research Letters | 2010-03-18 | Paper |
MIR closures of polyhedral sets
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
A feasibility pump for mixed integer nonlinear programs
Mathematical Programming. Series A. Series B | 2009-04-24 | Paper |
An algorithmic framework for convex mixed integer nonlinear programs
Discrete Optimization | 2008-10-29 | Paper |
CP-Based Local Branching
Principles and Practice of Constraint Programming – CP 2007 | 2008-09-02 | Paper |
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
Mathematics of Operations Research | 2008-05-27 | Paper |
An optimization problem in the electricity market
4OR | 2008-03-14 | Paper |
Projected Chvátal-Gomory cuts for mixed integer linear programs
Mathematical Programming. Series A. Series B | 2008-03-12 | Paper |
An MINLP Solution Method for a Water Network Problem
Lecture Notes in Computer Science | 2008-03-11 | Paper |
A feasibility pump heuristic for general mixed-integer problems
Discrete Optimization | 2008-02-22 | Paper |
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
On the MIR Closure of Polyhedra
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Repairing MIP infeasibility through local branching
Computers \& Operations Research | 2007-11-06 | Paper |
Optimizing over the First Chvàtal Closure
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
MIPping closures: An instant survey
Graphs and Combinatorics | 2007-07-19 | Paper |
Optimizing over the first Chvátal closure
Mathematical Programming. Series A. Series B | 2007-04-19 | Paper |
Packing into the smallest square: worst-case analysis of lower bounds
Discrete Optimization | 2007-02-20 | Paper |
Improving on branch-and-cut algorithms for generalized minimum spanning trees
| 2006-02-08 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
New approaches for optimizing over the semimetric polytope
Mathematical Programming. Series A. Series B | 2005-12-14 | Paper |
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
Mathematics of Operations Research | 2005-11-11 | Paper |
The feasibility pump
Mathematical Programming. Series A. Series B | 2005-10-31 | Paper |
scientific article; zbMATH DE number 2209661 (Why is no real title available?)
| 2005-09-28 | Paper |
scientific article; zbMATH DE number 2159472 (Why is no real title available?)
| 2005-04-19 | Paper |
scientific article; zbMATH DE number 2159468 (Why is no real title available?)
| 2005-04-19 | Paper |
TSpack: A unified tabu search code for multi-dimensional bin packing problems
Annals of Operations Research | 2005-01-17 | Paper |
Ond-threshold graphs andd-dimensional bin packing
Networks | 2005-01-12 | Paper |
Models and bounds for two-dimensional level packing problems
Journal of Combinatorial Optimization | 2004-11-22 | Paper |
scientific article; zbMATH DE number 2086931 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086916 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2080307 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2064419 (Why is no real title available?)
| 2004-05-18 | Paper |
scientific article; zbMATH DE number 2064407 (Why is no real title available?)
| 2004-05-18 | Paper |
Local branching
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
Local Search and Constraint Programming
International Series in Operations Research & Management Science | 2004-03-07 | Paper |
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
INFORMS Journal on Computing | 2003-11-06 | Paper |
Integer linear programming models for 2-staged two-dimensional knapsack problems
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
scientific article; zbMATH DE number 1953196 (Why is no real title available?)
| 2003-07-25 | Paper |
scientific article; zbMATH DE number 1953192 (Why is no real title available?)
| 2003-07-25 | Paper |
Primal cutting plane algorithms revisited
Mathematical Methods of Operations Research | 2003-07-14 | Paper |
Optimization-oriented global constraints
Constraints | 2003-05-04 | Paper |
Primal separation algorithms
4OR | 2003-01-01 | Paper |
Heuristic algorithms for the three-dimensional bin packing problem
European Journal of Operational Research | 2002-11-17 | Paper |
Two-dimensional packing problems: a survey
European Journal of Operational Research | 2002-11-17 | Paper |
Recent advances on two-dimensional bin packing problems
Discrete Applied Mathematics | 2002-09-17 | Paper |
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
Operations Research Letters | 2002-08-28 | Paper |
Embedding relaxations in global constraints for solving TSP and TSPTW
Annals of Mathematics and Artificial Intelligence | 2002-06-27 | Paper |
Mathematical programming techniques in constraint programming: a short overview
Journal of Heuristics | 2002-04-11 | Paper |
Solving TSP through the integration of OR and CP techniques
Electronic Notes in Discrete Mathematics | 2001-09-23 | Paper |
Exact and heuristic algorithms for data sets reconstruction
European Journal of Operational Research | 2001-05-20 | Paper |
scientific article; zbMATH DE number 1488076 (Why is no real title available?)
| 2000-08-10 | Paper |
An evolutionary heuristic for quadratic 0-1 programming
European Journal of Operational Research | 2000-06-27 | Paper |
Approximation algorithm for the oriented two-dimensional bin packing problem
European Journal of Operational Research | 2000-06-14 | Paper |
Solution of the cumulative assignment problem with a well-structured tabu search method
Journal of Heuristics | 1999-11-08 | Paper |
Operational Research: Methods and Applications
| N/A | Paper |
Assortment Optimization with Visibility Constraints
| N/A | Paper |
