:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Vincze, Csaba, Nagy, Ábris
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control Discrete Mathematics G.2.3
Online Access:	https://arxiv.org/abs/2304.08626
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fortifying Critical Infrastructure Networks with Multicriteria Portfolio Decision Analysis: An Application to Railway Stations in Finland
by: de la Barra, Joaquín, et al.
Published: (2025)

Mathematical Formulations And Results Regarding Two Echelon Electric Vehicle Routing Problems
by: Akbay, Mehmet Anıl, et al.
Published: (2024)

Binary Stretch Embedding of Weighted Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)

The connected Grundy coloring problem: Formulations and a local-search enhanced biased random-key genetic algorithm
by: Silva, Mateus C., et al.
Published: (2024)

Flow Shop Scheduling with Inter-Stage Flexibility and Blocking Constraints
by: Nicosia, Gaia, et al.
Published: (2024)

Prophet Inequalities: Separating Random Order from Order Selection
by: Giambartolomei, Giordano, et al.
Published: (2023)

IID Prophet Inequality with Random Horizon: Going Beyond Increasing Hazard Rates
by: Giambartolomei, Giordano, et al.
Published: (2024)

Balanced assignments of periodic tasks
by: Gachet, Héloïse, et al.
Published: (2024)

Price Optimal Routing in Public Transportation
by: Euler, Ricardo, et al.
Published: (2022)

Towards a geometric characterization of unbounded integer cubic optimization problems via thin rays
by: Del Pia, Alberto
Published: (2025)

The Binary Linearization Complexity of Pseudo-Boolean Functions
by: Walter, Matthias
Published: (2023)

Linear, nested, and quadratic ordered measures: Computation and incorporation into optimization problems
by: Blanco, Victor, et al.
Published: (2025)

Scheduling on identical machines with conflicts to minimize the mean flow time
by: Tellache, Nour ElHouda, et al.
Published: (2025)

Polynomial Complexity of Inversion of sequences and Local Inversion of Maps
by: Sule, Virendra
Published: (2024)

Robustness of Boolean networks to update modes: an application to hereditary angioedema
by: Demongeot, Jacques, et al.
Published: (2025)

Benchmarking Realistic Synthetic Instances Against a Large-Scale District Heating Network: A Multi-Objective Optimization Study for Berlin
by: Buchholz, Annika, et al.
Published: (2026)

An extended version of the Ordered Median Tree Location Problem including appendices and detailed computational results
by: Pozo, Miguel A., et al.
Published: (2022)

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
by: Costandin, Marius, et al.
Published: (2023)

A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem
by: Li, Zongji, et al.
Published: (2023)

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2023)

A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data
by: Ketkov, Sergey S.
Published: (2023)

A Knowledge Compilation Take on Binary Polynomial Optimization
by: Capelli, Florent, et al.
Published: (2023)

A Tight Formulation for the Dial-a-Ride Problem
by: Gaul, Daniela, et al.
Published: (2023)

Minimum Cut Representability of Stable Matching Problems
by: Faenza, Yuri, et al.
Published: (2025)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
by: Alidaee, Bahram, et al.
Published: (2024)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
by: Moldenhauer, Carsten, et al.
Published: (2025)

An SDP Relaxation for the Sparse Integer Least Squares Problem
by: Del Pia, Alberto, et al.
Published: (2022)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
by: Proença, Nathan Benedetto, et al.
Published: (2026)

Geoffrion's theorem beyond finiteness and rationality
by: Dey, Santanu S., et al.
Published: (2025)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
by: Wang, Changjun, et al.
Published: (2026)

On the Virtual Network Embedding polytope
by: Benhamiche, Amal, et al.
Published: (2026)

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
by: Jabbari-Marand, Behnam, et al.
Published: (2026)

Shortest Paths in Graphs of Convex Sets
by: Marcucci, Tobia, et al.
Published: (2021)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
by: Bernardelli, Ambrogio Maria, et al.
Published: (2024)

Order acceptance and scheduling in capacitated job shops
by: Linß, Florian, et al.
Published: (2024)

A review of minimum cost box searching games
by: Lidbetter, Thomas
Published: (2025)

Market proliferation and the impact of locational complexity on network restructuring
by: Pinar-Pérez, J. M., et al.
Published: (2024)

On Supportedness in Multi-Objective Combinatorial Optimization
by: Könen, David, et al.
Published: (2025)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
by: Swamy, Rahul, et al.
Published: (2024)

An exact approach for the multi-depot electric vehicle scheduling problem
by: Haslinger, Xenia, et al.
Published: (2025)