| Publication | Date of Publication | Type |
|---|
| A solution algorithm for chance-constrained problems with integer second-stage recourse decisions | 2024-04-09 | Paper |
| Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning | 2024-03-26 | Paper |
| Learning to repeatedly solve routing problems | 2024-03-15 | Paper |
| A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs | 2024-03-12 | Paper |
| Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities | 2024-02-27 | Paper |
| Fairness over time in dynamic resource allocation with an application in healthcare | 2024-02-21 | Paper |
| Deep Neural Networks Pruning via the Structured Perspective Regularization | 2024-01-11 | Paper |
| Neural networks for local search and crossover in vehicle routing: a possible overkill? | 2023-10-04 | Paper |
| Continuous cutting plane algorithms in integer programming | 2023-09-12 | Paper |
| Disjunctive cuts in mixed-integer conic optimization | 2023-05-02 | Paper |
| A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX | 2023-01-10 | Paper |
| A learning-based algorithm to quickly compute good primal solutions for stochastic integer programs | 2022-12-21 | Paper |
| A theoretical and computational equilibria analysis of a multi-player kidney exchange program | 2022-10-17 | Paper |
| On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming | 2022-10-14 | Paper |
| An ILP Model for Multi-Label MRFs With Connectivity Constraints | 2022-09-16 | Paper |
| Measures of balance in combinatorial optimization | 2022-08-26 | Paper |
| Computing equilibria for integer programming games | 2022-08-03 | Paper |
| On the Estimation of Discrete Choice Models to Capture Irrational Customer Behaviors | 2022-07-01 | Paper |
| Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information | 2022-06-28 | Paper |
| The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints | 2022-06-27 | Paper |
| Cutting Plane Generation through Sparse Principal Component Analysis | 2022-06-17 | Paper |
| BDD-based optimization for the quadratic stable set problem | 2022-06-09 | Paper |
| Single Allocation Hub Location with Heterogeneous Economies of Scale | 2022-05-31 | Paper |
| Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound | 2022-04-22 | Paper |
| Nonlinear chance-constrained problems with applications to hydro scheduling | 2022-03-22 | Paper |
| On generalized surrogate duality in mixed-integer nonlinear programming | 2022-03-22 | Paper |
| Guidelines for the computational testing of machine learning approaches to vehicle routing problems | 2022-03-11 | Paper |
| Design and implementation of a modular interior-point solver for linear optimization | 2021-12-27 | Paper |
| Lattice Reformulation Cuts | 2021-11-05 | Paper |
| Learning chordal extensions | 2021-08-17 | Paper |
| Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times | 2021-06-17 | Paper |
| Multilevel Approaches for the Critical Node Problem | 2021-06-17 | Paper |
| Tabu search for the time-dependent vehicle routing problem with time windows on a road network | 2021-06-03 | Paper |
| Machine learning for combinatorial optimization: a methodological tour d'horizon | 2021-06-03 | Paper |
| An Exact Algorithmic Framework for a Class of Mixed-Integer Programs with Equilibrium Constraints | 2021-02-02 | Paper |
| Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem | 2020-08-28 | Paper |
| A multicut outer-approximation approach for competitive facility location under random utilities | 2020-05-07 | Paper |
| Joint location and pricing within a user-optimized environment | 2020-03-25 | Paper |
| QPLIB: a library of quadratic programming instances | 2019-12-19 | Paper |
| Ten years of feasibility pump, and counting | 2019-10-18 | Paper |
| Using cost-based solution densities from TSP relaxations to solve routing problems | 2019-10-14 | Paper |
| Learning MILP resolution outcomes before reaching time-limit | 2019-10-14 | Paper |
| A polynomial algorithm for a continuous bilevel knapsack problem | 2019-06-11 | Paper |
| Solving Quadratic Programming by Cutting Planes | 2019-05-07 | Paper |
| A comparison of optimization methods for multi-objective constrained bin packing problems | 2018-11-21 | Paper |
| Learning a classification of mixed-integer quadratic programming problems | 2018-11-21 | Paper |
| Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics | 2018-08-22 | Paper |
| Experiments on virtual private network design with concave capacity costs | 2018-07-31 | Paper |
| On the difficulty of virtual private network instances | 2018-05-23 | Paper |
| Integral simplex using decomposition with primal cutting planes | 2017-12-01 | Paper |
| On learning and branching: a survey | 2017-10-12 | Paper |
| Rejoinder on: ``On learning and branching: a survey | 2017-10-12 | Paper |
| Cutting planes from wide split disjunctions | 2017-08-31 | Paper |
| Bounding, filtering and diversification in CP-based local branching | 2017-04-04 | Paper |
| On the Practical Strength of Two-Row Tableau Cuts | 2017-02-17 | Paper |
| Nash equilibria in the two-player kidney exchange game | 2017-02-03 | Paper |
| Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints | 2016-12-22 | Paper |
| On handling indicator constraints in mixed integer programming | 2016-12-15 | Paper |
| Mathematical programming techniques in water network optimization | 2016-10-06 | Paper |
| Erratum to ``Mathematical programming techniques in water network optimization | 2016-10-06 | Paper |
| Bilevel Knapsack with Interdiction Constraints | 2016-08-12 | Paper |
| A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows | 2016-06-29 | Paper |
| Optimistic MILP modeling of non-linear optimization problems | 2016-06-24 | Paper |
| Single-commodity robust network design problem: complexity, instances and heuristic solutions | 2016-06-23 | Paper |
| Single-commodity robust network design with finite and hose demand sets | 2016-06-06 | Paper |
| Improving branch-and-cut performance by random sampling | 2016-04-13 | Paper |
| Virtual private network design over the first Chvátal closure | 2015-08-14 | Paper |
| On mathematical programming with indicator constraints | 2015-06-19 | Paper |
| A Study on the Computational Complexity of the Bilevel Knapsack Problem | 2014-09-26 | Paper |
| Bilevel programming and the separation problem | 2014-08-29 | Paper |
| On the optimal design of water distribution networks: a practical MINLP approach | 2014-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861491 | 2013-11-08 | Paper |
| Mixed integer nonlinear programming tools: an updated practical overview | 2013-08-08 | Paper |
| Improving spectral bounds for clustering problems by Lagrangian relaxation | 2013-04-24 | Paper |
| A Complexity and Approximability Study of the Bilevel Knapsack Problem | 2013-03-19 | Paper |
| A storm of feasibility pumps for nonconvex MINLP | 2012-12-19 | Paper |
| Complexity and approximation of an area packing problem | 2012-11-30 | Paper |
| Exact algorithms for the two-dimensional guillotine knapsack | 2012-11-15 | Paper |
| Models and Algorithms for Robust Network Design with Several Traffic Scenarios | 2012-11-02 | Paper |
| An effective branch-and-bound algorithm for convex quadratic integer programming | 2012-10-15 | Paper |
| An approximation scheme for the two-stage, two-dimensional knapsack problem | 2012-06-20 | Paper |
| Discrepancy-Based Additive Bounding Procedures | 2012-06-18 | Paper |
| A Hybrid Exact Algorithm for the TSPTW | 2012-05-30 | Paper |
| Mixed integer nonlinear programming tools: a practical overview | 2012-03-23 | Paper |
| A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems | 2012-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3109952 | 2012-01-26 | Paper |
| On the separation of disjunctive cuts | 2011-06-17 | Paper |
| Computing compatible tours for the symmetric traveling salesman problem | 2011-06-08 | Paper |
| On Bilevel Programming and Its Impact in Branching, Cutting and Complexity | 2011-05-26 | Paper |
| On Counting Lattice Points and Chvátal-Gomory Cutting Planes | 2011-05-26 | Paper |
| Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities | 2011-04-27 | Paper |
| Hybrid Solving Techniques | 2010-12-22 | Paper |
| On interval-subgradient and no-good cuts | 2010-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3059312 | 2010-12-08 | Paper |
| Efficient and fair routing for mesh networks | 2010-09-16 | Paper |
| An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming | 2010-06-22 | Paper |
| Experiments with Two Row Tableau Cuts | 2010-06-22 | Paper |
| Mixed Integer Programming Computation | 2010-06-03 | Paper |
| Erratum to: MIR closures of polyhedral sets | 2010-04-15 | Paper |
| Piecewise linear approximation of functions of two variables in MILP models | 2010-03-18 | Paper |
| MIR closures of polyhedral sets | 2010-02-19 | Paper |
| A feasibility pump for mixed integer nonlinear programs | 2009-04-24 | Paper |
| An algorithmic framework for convex mixed integer nonlinear programs | 2008-10-29 | Paper |
| CP-Based Local Branching | 2008-09-02 | Paper |
| Polynomial-Time Separation of a Superclass of Simple Comb Inequalities | 2008-05-27 | Paper |
| An optimization problem in the electricity market | 2008-03-14 | Paper |
| Projected Chvátal-Gomory cuts for mixed integer linear programs | 2008-03-12 | Paper |
| An MINLP Solution Method for a Water Network Problem | 2008-03-11 | Paper |
| A feasibility pump heuristic for general mixed-integer problems | 2008-02-22 | Paper |
| On the MIR Closure of Polyhedra | 2007-11-29 | Paper |
| Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities | 2007-11-29 | Paper |
| Repairing MIP infeasibility through local branching | 2007-11-06 | Paper |
| Optimizing over the First Chvàtal Closure | 2007-08-30 | Paper |
| MIPping closures: An instant survey | 2007-07-19 | Paper |
| Optimizing over the first Chvátal closure | 2007-04-19 | Paper |
| Packing into the smallest square: worst-case analysis of lower bounds | 2007-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3368660 | 2006-02-08 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| New approaches for optimizing over the semimetric polytope | 2005-12-14 | Paper |
| Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing | 2005-11-11 | Paper |
| The feasibility pump | 2005-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692638 | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667439 | 2005-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667443 | 2005-04-19 | Paper |
| TSpack: A unified tabu search code for multi-dimensional bin packing problems | 2005-01-17 | Paper |
| Ond-threshold graphs andd-dimensional bin packing | 2005-01-12 | Paper |
| Models and bounds for two-dimensional level packing problems | 2004-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737521 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737536 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473026 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461906 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461918 | 2004-05-18 | Paper |
| Local branching | 2004-03-11 | Paper |
| Local Search and Constraint Programming | 2004-03-07 | Paper |
| Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems | 2003-11-06 | Paper |
| Integer linear programming models for 2-staged two-dimensional knapsack problems | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414638 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414642 | 2003-07-25 | Paper |
| Primal cutting plane algorithms revisited | 2003-07-14 | Paper |
| Optimization-oriented global constraints | 2003-05-04 | Paper |
| Primal separation algorithms | 2003-01-01 | Paper |
| Two-dimensional packing problems: a survey | 2002-11-17 | Paper |
| Heuristic algorithms for the three-dimensional bin packing problem | 2002-11-17 | Paper |
| Recent advances on two-dimensional bin packing problems | 2002-09-17 | Paper |
| Strengthening Chvátal-Gomory cuts and Gomory fractional cuts | 2002-08-28 | Paper |
| Embedding relaxations in global constraints for solving TSP and TSPTW | 2002-06-27 | Paper |
| Mathematical programming techniques in constraint programming: a short overview | 2002-04-11 | Paper |
| Solving TSP through the Integration of OR and CP Techniques | 2001-09-23 | Paper |
| Exact and heuristic algorithms for data sets reconstruction | 2001-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495176 | 2000-08-10 | Paper |
| An evolutionary heuristic for quadratic 0-1 programming | 2000-06-27 | Paper |
| Approximation algorithm for the oriented two-dimensional bin packing problem | 2000-06-14 | Paper |
| Solution of the cumulative assignment problem with a well-structured tabu search method | 1999-11-08 | Paper |
