Copertina

Optimization Models for the Quadratic Traveling Salesperson Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chen, Yuxiao, Sathish, Nivetha, Singh, Anubhav, Kuroiwa, Ryo, Beck, J. Christopher
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Combinatorics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The Keplerian Traveling Salesperson Problem
di: Bannach, Max, et al.
Pubblicazione: (2026)

A Modular-Form Framework for Global Optimality in the Asymmetric Traveling-Salesman Problem
di: Gupta, Varsha
Pubblicazione: (2024)

Exact Two-Step Benders Decomposition for the Time Window Assignment Traveling Salesperson Problem
di: Celik, Sifa, et al.
Pubblicazione: (2023)

A Convex Hull Cheapest Insertion Heuristic for Precedence Constrained Traveling Salesperson Problems or Sequential Ordering Problems
di: Goutham, Mithun, et al.
Pubblicazione: (2023)

The Integrated Vehicle and Pollster Routing Problem
di: Gutiérrez, Sandra, et al.
Pubblicazione: (2019)

On Solving the Set Covering Problem with Conflicts on Sets
di: Montemanni, Roberto, et al.
Pubblicazione: (2025)

Strength of the Upper Bounds for the Edge-Weighted Maximum Clique Problem
di: Ciccarelli, Fabio, et al.
Pubblicazione: (2025)

Computation of Set Tolerances with Applications to the Minimum Spanning Tree Problem
di: Jäger, Gerold, et al.
Pubblicazione: (2026)

A Vehicle Routing Problem for Human-Centered Electric Mobility
di: Emam, Mostafa, et al.
Pubblicazione: (2026)

Conic-Optimization Based Algorithms for Nonnegative Matrix Factorization
di: Leplat, Valentin, et al.
Pubblicazione: (2021)

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem
di: Großmann, Ernestine, et al.
Pubblicazione: (2024)

Tensor Network Generator-Enhanced Optimization for Traveling Salesman Problem
di: Sakai, Ryo, et al.
Pubblicazione: (2026)

Towards Enabling Learning for Time-Varying finite horizon Sequential Decision-Making Problems*
di: Tiwari, Dhananjay, et al.
Pubblicazione: (2025)

A Quantum Inspired Bi-level Optimization Algorithm for the First Responder Network Design Problem
di: Karahalios, Anthony, et al.
Pubblicazione: (2024)

Performance-Guaranteed Solutions for Multi-Agent Optimal Coverage Problems using Submodularity, Curvature, and Greedy Algorithms
di: Welikala, Shirantha, et al.
Pubblicazione: (2024)

Column Generation Using Domain-Independent Dynamic Programming
di: Kuroiwa, Ryo, et al.
Pubblicazione: (2025)

Quantum-Informed Recursive Optimization Algorithms
di: Finžgar, Jernej Rudi, et al.
Pubblicazione: (2023)

Low degree sum-of-squares bounds for the stability number: a copositive approach
di: Vargas, Luis Felipe, et al.
Pubblicazione: (2025)

Testing Quantum and Simulated Annealers on the Drone Delivery Packing Problem
di: Tarquini, Sara, et al.
Pubblicazione: (2024)

Generalized algebraic connectivity of graphs in Euclidean spaces: extremal properties and bounds
di: Presenza, Juan F., et al.
Pubblicazione: (2025)

Effect of Constraint Relaxation on the Minimum Vertex Cover Problem in Random Graphs
di: Dote, Aki, et al.
Pubblicazione: (2023)

Kazhdan-Lusztig Basis and Optimization
di: Goertzen, Tom, et al.
Pubblicazione: (2026)

Exact Flatness Constant for One-Point Convex Bodies and the Discrete Isominwidth Problem: The Planar Case
di: Averkov, Gennadiy, et al.
Pubblicazione: (2026)

Improvements on Permutation Reconstruction from Minors
di: Ma, Yiming, et al.
Pubblicazione: (2024)

On disjunction convex hulls by lifting
di: Qu, Yushan, et al.
Pubblicazione: (2024)

An Efficient Algorithm for Vertex Enumeration of Arrangement
di: Dong, Zelin, et al.
Pubblicazione: (2024)

A computational study of cutting-plane methods for multi-stage stochastic integer programs
di: Bansal, Akul, et al.
Pubblicazione: (2024)

A characterization of unimodular hypergraphs with disjoint hyperedges
di: Caoduro, Marco, et al.
Pubblicazione: (2024)

Branching with a pre-specified finite list of $k$-sparse split sets for binary MILPs
di: Dey, Santanu S., et al.
Pubblicazione: (2024)

Hub location with congestion and time-sensitive demand
di: Domínguez-Bravo, Carmen-Ana, et al.
Pubblicazione: (2024)

Bilevel Programming for Pebbling Numbers of Lemke Graph Products
di: Pulaj, Jonad, et al.
Pubblicazione: (2024)

Polyhedral study of a temporal rural postman problem: application in inspection of railway track without disturbing train schedules
di: Buriuly, Somnath, et al.
Pubblicazione: (2024)

Conformal Rigidity and Spectral Embeddings of Graphs
di: Gouveia, João, et al.
Pubblicazione: (2025)

Cutting plane methods with gradient-based heuristics
di: Bùi, Hòa T., et al.
Pubblicazione: (2025)

Lower and Upper Bounds for Small Canonical and Ordered Ramsey Numbers
di: Brosch, Daniel, et al.
Pubblicazione: (2025)

Faces of homogeneous cones and applications to homogeneous chordality
di: Gouveia, João, et al.
Pubblicazione: (2025)

Stable matchings with switching costs
di: Pittel, Boris, et al.
Pubblicazione: (2025)

Integer Carathéodory results with bounded multiplicity
di: Kuhlmann, Stefan
Pubblicazione: (2023)

The sum of root-leaf distance interdiction problem with cardinality constraint by upgrading edges on trees
di: Li, Xiao, et al.
Pubblicazione: (2023)

A Facet Enumeration Algorithm for Convex Polytopes
di: Yang, Yaguang
Pubblicazione: (2019)