Copertina

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Alidaee, Bahram, Wang, Haibo
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Efficient Local and Tabu Search Strategies for Large-Scale Quadratic Integer Programming
di: Wang, Haibo, et al.
Pubblicazione: (2024)

A Heuristic Framework of Variable Neighborhood Descent Methods for the Large-Scale Multi-Level Facility Location Problem in Supply Chain Networks
di: Wang, Haibo, et al.
Pubblicazione: (2025)

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

A Unified Framework for Integer Programming Formulation of Graph Matching Problems
di: Alidaee, Bahram, et al.
Pubblicazione: (2024)

The Mixed Integer Trust Region Problem
di: Del Pia, Alberto
Pubblicazione: (2024)

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

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

Recommend-to-Match with Random Supply Rejections: Formulation, Approximation, and Analysis
di: Liu, Haoyue, et al.
Pubblicazione: (2025)

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

A Bilevel Integer Programming Approach for the Synchronous Attractor Control Problem
di: Moon, Kyungduk, et al.
Pubblicazione: (2026)

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

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

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
di: Schade, Jamico, et al.
Pubblicazione: (2023)

Combinatorial Algorithm for Tropical Linearly Factorized Programming
di: Nishida, Yuki
Pubblicazione: (2025)

Linear Programming Hierarchies Collapse under Symmetry
di: Faenza, Yuri, et al.
Pubblicazione: (2025)

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

The Integrality Gap of the Traveling Salesman Problem is $4/3$ if the LP Solution Has at Most $n+6$ Non-zero Components
di: Villa, Tullio, et al.
Pubblicazione: (2025)

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

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
di: Vercesi, Eleonora, et al.
Pubblicazione: (2025)

Assortment Optimization For Conference Goodies With Indifferent Attendees
di: Gutiérrez, Fernanda, et al.
Pubblicazione: (2024)

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

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
di: Baeckelant, Timothy, et al.
Pubblicazione: (2026)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
di: Lozano, Leonardo, et al.
Pubblicazione: (2022)

Learning to Remove Cuts in Integer Linear Programming
di: Puigdemont, Pol, et al.
Pubblicazione: (2024)

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

A review of minimum cost box searching games
di: Lidbetter, Thomas
Pubblicazione: (2025)

A generic Branch-and-Cut algorithm for bi-objective binary linear programs
di: Fouilhoux, Pierre, et al.
Pubblicazione: (2024)

A parallel pull labelling algorithm for the resource constrained shortest path problem
di: Petersen, Bjørn, et al.
Pubblicazione: (2025)

System Architecture Optimization Strategies: Dealing with Expensive Hierarchical Problems
di: Bussemaker, Jasper H., et al.
Pubblicazione: (2025)

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

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
di: Bangerter, Elise, et al.
Pubblicazione: (2026)

A Branch-and-Cut Algorithm for the Optimal Design of Parking Lots with One-way and Two-way Lanes
di: Thomas, Helen, et al.
Pubblicazione: (2025)

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

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

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

Factorized binary polynomial optimization
di: Del Pia, Alberto
Pubblicazione: (2024)

Chorded cycle facets of the clique partitioning polytope
di: Irmai, Jannik, et al.
Pubblicazione: (2024)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
di: Del Pia, Alberto, et al.
Pubblicazione: (2024)

Revisiting some classical linearizations of the quadratic binary optimization problem
di: Punnen, Abraham P., et al.
Pubblicazione: (2024)

Robust Deterministic Policies for Markov Decision Processes under Budgeted Uncertainty
di: Wu, Fei, et al.
Pubblicazione: (2024)