Linked e-resources
Details
Table of Contents
Polyhedra and Algorithms
New classes of facets for complementarity knapsack problems
Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints
The Constrained-Routing and Spectrum Assignment Problem: Valid Inequalities and Branch-and-Cut Algorithm
Polyhedra and Combinatorics
Top-$k$ List Aggregation: Mathematical Formulations and Polyhedral Comparisons
Bounded variation in binary sequences
On Minimally Non-Firm Binary Matrices
Few Induced Disjoint Paths for H-Free Graphs
On Permuting some Coordinates of Polytopes
Non-linear Optimization
Piecewise linearization of bivariate nonlinear functions: minimizing the number of pieces under a bounded approximation error
An outer-approximation algorithm for maximum-entropy sampling
Mitigating Anomalies in Parallel Branch-and-Bound Based Algorithms for Mixed-Integer Nonlinear Optimization
Game Theory
Exact Price of Anarchy for Weighted Congestion Games with Two Players
Nash balanced assignment problem
Graphs and Trees
On the thinness of trees
Generating Spanning Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms
Cutting and Packing
High Multiplicity Strip Packing with Three Rectangle Types
Improved Bounds for Stochastic Extensible Bin Packing under Distributional Assumptions
Applications
One transfer per patient suffices: Structural insights about patient-to-room assignment
Tool switching problems in the context of overlay printing with multiple colours
Optimal Vaccination Strategies for Multiple Dose Vaccinations
Approximation Algorithms
Pervasive Domination
Unified Greedy Approximability Beyond Submodular Maximization
Neighborhood persistency of the linear optimization relaxation of integer linear optimization
Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines.
New classes of facets for complementarity knapsack problems
Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints
The Constrained-Routing and Spectrum Assignment Problem: Valid Inequalities and Branch-and-Cut Algorithm
Polyhedra and Combinatorics
Top-$k$ List Aggregation: Mathematical Formulations and Polyhedral Comparisons
Bounded variation in binary sequences
On Minimally Non-Firm Binary Matrices
Few Induced Disjoint Paths for H-Free Graphs
On Permuting some Coordinates of Polytopes
Non-linear Optimization
Piecewise linearization of bivariate nonlinear functions: minimizing the number of pieces under a bounded approximation error
An outer-approximation algorithm for maximum-entropy sampling
Mitigating Anomalies in Parallel Branch-and-Bound Based Algorithms for Mixed-Integer Nonlinear Optimization
Game Theory
Exact Price of Anarchy for Weighted Congestion Games with Two Players
Nash balanced assignment problem
Graphs and Trees
On the thinness of trees
Generating Spanning Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms
Cutting and Packing
High Multiplicity Strip Packing with Three Rectangle Types
Improved Bounds for Stochastic Extensible Bin Packing under Distributional Assumptions
Applications
One transfer per patient suffices: Structural insights about patient-to-room assignment
Tool switching problems in the context of overlay printing with multiple colours
Optimal Vaccination Strategies for Multiple Dose Vaccinations
Approximation Algorithms
Pervasive Domination
Unified Greedy Approximability Beyond Submodular Maximization
Neighborhood persistency of the linear optimization relaxation of integer linear optimization
Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines.