Abstract is missing.
- On Disjunction Convex Hulls by LiftingYushan Qu, Jon Lee 0001. 3-15 [doi]
- On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site LocationClaudia D'Ambrosio, Marcia Fampa, Jon Lee 0001, Felipe Sinnecker. 16-29 [doi]
- Quadratically Constrained Reformulation, Strong Semidefinite Programming Bounds, and Algorithms for the Chordless Cycle ProblemDilson Lucas Pereira, Dilson Almeida Guimarães, Alexandre Salles da Cunha, Abilio Lucena. 30-42 [doi]
- A Family of Spanning-Tree Formulations for the Maximum Cut ProblemSven Mallach. 43-55 [doi]
- Optimal Cycle Selections: An Experimental Assessment of Integer Programming FormulationsMarie Baratto, Yves Crama. 56-70 [doi]
- 1-Persistency of the Clique Relaxation of the Stable Set PolytopeDiego Delle Donne, Mariana S. Escalante, Pablo G. Fekete, Lucía Moroni. 71-84 [doi]
- Alternating Direction Method and Deep Learning for Discrete Control with StorageSophie Demassey, Valentina Sessa, Amirhossein Tavakoli. 85-96 [doi]
- Branch and Cut for Partitioning a Graph into a Cycle of ClustersLeon Eifler, Jakob Witzig, Ambros M. Gleixner. 97-108 [doi]
- Computing the Edge Expansion of a Graph Using Semidefinite ProgrammingAkshay Gupte, Melanie Siebenhofer, Angelika Wiegele. 111-124 [doi]
- Minimizing External Vertices in Hypergraph OrientationsAlberto José Ferrari, Valeria A. Leoni, Graciela L. Nasini, Gabriel Valiente. 125-136 [doi]
- Open-Separating Dominating Codes in GraphsDipayan Chakraborty, Annegret Katrin Wagler. 137-151 [doi]
- On the Complexity of the Minimum Chromatic Violation ProblemDiego Delle Donne, Mariana S. Escalante, María Elisa Ugarte. 152-162 [doi]
- Crystal TreesRafael Castro de Andrade. 163-172 [doi]
- Reducing Treewidth for SAT-Related Problems Using Simple LiftingsErnst Althaus, Daniela Schnurbusch. 175-191 [doi]
- Total Matching and SubdeterminantsLuca Ferrarini, Samuel Fiorini, Stefan Kober, Yelena Yuditsky. 192-204 [doi]
- A New Structural Parameter on Single Machine Scheduling with Release Dates and DeadlinesMaher Mallem, Claire Hanen, Alix Munier Kordon. 205-219 [doi]
- Fixed-Parameter Algorithms for Cardinality-Constrained Graph Partitioning Problems on Sparse GraphsSuguru Yamada, Tesshu Hanaka. 220-232 [doi]
- Sequencing Stochastic Jobs with a Single SamplePuck te Rietmole, Marc Uetz. 235-247 [doi]
- The Thief Orienteering Problem on Series-Parallel GraphsAndrew Bloch-Hansen, Roberto Solis-Oba. 248-262 [doi]
- Approximation Algorithm for Job Scheduling with Reconfigurable ResourcesPierre Bergé, Mari Chaikovskaia, Jean-Philippe Gayon, Alain Quilliot. 263-276 [doi]
- Network Design on Undirected Series-Parallel GraphsIshan Bansal, Ryan Mao, Avhan Misra. 277-288 [doi]
- Online Graph Coloring with PredictionsAntonios Antoniadis 0001, Hajo Broersma, Yang Meng 0001. 289-302 [doi]
- Neuron Pairs in Binarized Neural Networks Robustness Verification via Integer Linear ProgrammingDymitr Lubczyk, José Neto. 305-317 [doi]
- Optimal Counterfactual Explanations for k-Nearest Neighbors Using Mathematical Optimization and Constraint ProgrammingClaudio Contardo, Ricardo Fukasawa, Louis-Martin Rousseau, Thibaut Vidal. 318-331 [doi]
- Surrogate Constraints for Synchronized Energy Production/ConsumptionFatiha Bendali, Alejandro Olivas Gonzales, Alain Quilliot, Hélène Toussaint. 335-347 [doi]
- A Robust Two-Stage Model for the Urban Air Mobility Flight Scheduling ProblemTom Portoleau, Claudia D'Ambrosio. 348-360 [doi]
- Optimal Charging Station Location in a Linear Cycle Path with DeviationsLuca Pirolo, Pietro Belotti, Federico Malucelli, Rossella Moscarelli, Paolo Pileri. 361-375 [doi]
- An Efficient Timing Algorithm for Drivers with Rest PeriodsGiovanni Righini, Marco Trubian. 376-387 [doi]
- Fair Energy Allocation for Collective Self-consumptionNatalia Jorquera-Bravo, Sourour Elloumi, Safia Kedad-Sidhoum, Agnès Plateau. 388-401 [doi]
- Day-Ahead Lot-Sizing Under Uncertainty: An Application to Green Hydrogen ProductionVictor Spitzer, Céline Gicquel, Evgeny Gurevsky 0001, François Sanson. 402-416 [doi]