Combinatorial Optimization

Follow this topic Ask about this topic

Momentum

33 papers in the last four weeks, up 83% on the four weeks before. 0.3% of all new papers.

Jul 13Week of Sep 28

Latest papers 277

All topics

Local Search on Vertex Coloring for Bipartite Graphs
Jun 8, 2026Johanna GasseCombinatorial Optimization Local Search
Fachgebiet Algorithm Engineering der Digital-Engineering-Fakultät der Universität Potsdam
Leveraging Structural Constraints for Diffusion-based Neural TSP Solvers
Jun 8, 2026Mickaël Basson, Philippe PreuxTraveling Salesperson Problem Inference-Time Optimization
CRIStAL, Scool · Université de Lille, France · CNRS, France +2
Scaling Decision-Focused Learning to Large Problems with Lagrangian Decomposition
Jun 7, 2026Stéphane Eilles-Chan Way, Hugo Percot, Quentin Cappart +2Predict-Then-Optimize Learning to Optimize
Polytechnique Montréal, Montreal, Canada · Ecole Polytechnique, Palaiseau, France · UCLouvain, Louvain-la-Neuve, Belgium +2
Integrating Deep Learning Demand Forecasting with Multi-Objective Optimization for Circular Coffee Supply Chains: A Data-Driven Framework for Cost, Emissions, and Freshness Management
Jun 6, 2026Gerçek Budak, Faraz Gholamzadeh Gharehgheshlaghi, Melika Barjesteh Vaezi +1Time Series Forecasting Combinatorial Optimization
Department of Industrial Engineering, Ankara Yıldırım Beyazıt University, Keçiören, Ankara 06010, Türkiye · Department of Kinesiology and Sport Management, Texas Tech University, Lubbock, TX, United States · Department of Civil, Construction, and Environmental Engineering, University of Alabama, Tuscaloosa, AL, USA
Gray-Box Optimization and the Vertex Coloring Problem
Jun 6, 2026Johanna Gasse, Antonia Heinen, Hendrik Higl +1Evolutionary Optimization Metaheuristic Optimization
Hasso Plattner Institute University of Potsdam Potsdam, Germany
Minibatch Selection for Language Models via Partition Matroid Constrained Gradient Matching
Jun 6, 2026Prayas Agrawal, Prateek Chanda, Ishita Khatri +3Submodular Optimization LLM Fine-Tuning
Department of Computer Science and Engineering, Indian Institute of Technology Bombay · Microsoft Research India · Centre for Machine Intelligence and Data Science, Indian Institute of Technology Bombay +1
Combinatorial Landscape Analysis for Dominating Set and Vertex Coloring
Jun 5, 2026Johanna Gasse, Antonia Heinen, Felix Knöfel +2Combinatorial Optimization Local Search
Hasso Plattner Institute, Potsdam, Germany
A Study of Parallel Continuous Local Search
Jun 4, 2026Cody J Christopher, Charles GrettonMetaheuristic Optimization Combinatorial Optimization
School of Computing, Australian National University, Canberra, Australia.
Bidirectional Search for Longest Paths: Case for Front-to-Front Heuristics
Jun 4, 2026Tzur Shubi, Ariel Felner, Solomon Eyal Shimony +1Branch and Bound Tree Search
Stein Faculty of Computer and Information Science, Ben-Gurion University of the Negev, Israel
Learning-Augmented Online Minimization with Dual Predictions
Jun 3, 2026Christian Coester, Alexa Tudose, Alexander TuroczyCombinatorial Optimization Learning-Augmented Algorithms
University of Oxford, United Kingdom
Contrastive Neural Algorithmic Reasoning for Graph Coloring
Jun 2, 2026Thien Le, Tianyu Zhao, Melanie WeberGraph Neural Networks Graph Representation Learning
Harvard University SEAS · Harvard University T.H. Chan School of Public Health
Beyond Gradient Descent: Adam for Analog Ising Machines
Jun 2, 2026Stijn Van Vooren, Guy Van der Sande, Guy VerschaffeltCombinatorial Optimization Adaptive Gradient Methods
Applied Physics research group, Vrije Universiteit Brussel, Pleinlaan 2, 1050 Brussels, Belgium∗
Beyond Static Priors: Dynamic Neural Guidance for Large-Scale Ant Colony Optimization
Jun 2, 2026Dat Thanh Tran, Van Khu Vu, Yining MaTraveling Salesperson Problem Metaheuristic Optimization
Center for AI Research VinUniversity Hanoi, Vietnam · College of Engineering and Computer Science VinUniversity Hanoi, Vietnam · Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge, MA, USA
Regularized Large Neighborhood Search
Jun 1, 2026Germain Vivier-Ardisson, Laurent Demonet, Axel Parmentier +1Markov Chain Monte Carlo Metaheuristic Optimization
Google DeepMind & CERMICS · Google Research · CERMICS, ENPC, CNRS, IPP +1
Edge-aware Decoding for Neural Asymmetric Routing
Jun 1, 2026Li Liang, Jinbiao Chen, Zizhen ZhangCombinatorial Optimization Vehicle Routing
Sun Yat-Sen University · Department of Industrial Systems Engineering and Management, National University of Singapore
MViewRouter: Internalizing Geometric Equivariance via Multi-view Alternating Attention for Combinatorial Routing
May 31, 2026Shiyan Liu, Bohan Tan, Yaoxin Wu +1Traveling Salesperson Problem Multi-View Learning
Huazhong University of Science and Technology · Eindhoven University of Technology
LLM-Driven Co-Evolutionary Automated Heuristic Design for Bi-Component Coupled Combinatorial Optimization
May 30, 2026Mingen Kuang, Xudong Deng, Xi Lin +3Automated Heuristic Design Evolutionary Optimization
Xi’an Jiao Tong University · Northwestern Polytechnical University
Linear Ordering Problem: Time for a Change
May 29, 2026Fabrizio Fagiolo, Marco Baioletti, Valentino SantucciCombinatorial Optimization Quality-Diversity Optimization
University for Foreigners of Perugia, Perugia 06123, Italy · University of Perugia, Perugia 06123, Italy
Learning to Solve and Optimize by Evolving Code
May 29, 2026Veronika Semmelrock, Benedetta Strizzolo, Francesco Zuccato +3Automated Algorithm Discovery Evolutionary Optimization
University of Klagenfurt, Austria · University of Udine, Italy
Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems
May 28, 2026Benjamin Doerr, Pietro S. Oliveto, John Alasdair WarwickerMetaheuristic Optimization Combinatorial Optimization
Laboratoire d’Informatique (LIX), CNRS, École Polytechnique, Institut Polytechnique de Paris,2026 Palaiseau, 91120, France · Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, 518055, China · School of Computing & Communications, Lancaster University Leipzig, Leipzig, 04109, Germany
Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability
May 28, 2026Pedro Orvalho, Marta Kwiatkowska, Guillem Alenyà +1Large Language Model-Guided Optimization LLM-Based Program Synthesis
Artificial Intelligence Research Institute (IIIA) Consejo Superior de Investigaciones Científicas (CSIC) Barcelona, Catalonia, Spain · Department of Computer Science University of Oxford Oxford, UK · Institut de Robòtica i Informàtica Industrial (IRI-CSIC-UPC) Barcelona, Catalonia, Spain
Runtime Analysis of a Compact Genetic Algorithm on a Truly Multi-valued OneMax Function
May 28, 2026Martin S. Krejca, Carsten WittStochastic Optimization Evolutionary Optimization
Laboratoire d’Informatique (LIX), CNRS, École Polytechnique, IP Paris, France · DTU Compute, Technical University of Denmark, Denmark
Solving Integer Linear Programming with Parallel Tempering
May 28, 2026Kyuil Sim, Sanghyeok Choi, Jinkyoo ParkMarkov Chain Monte Carlo Mixed-Integer Linear Programming
1KAIST · University of Edinburgh
Harmonizing Real-Time Constraints and Long-Horizon Reasoning: An Asynchronous Agentic Framework for Dynamic Scheduling
May 28, 2026Shijie Cao, Yuan Yuan, Jing LiuLanguage Model-Based Control Real-Time Scheduling
School of Computer Science and Engineering, Beihang University, Beijing 100191, China · Shenzhen Loop Area Institute, Shenzhen, China · Qingdao Research Institute, Beihang University +3
LoRe: Adaptive Interaction-Evaluation Routing with Per-Step Interaction Budgets for Iterative Graph Solvers
May 27, 2026Jintao Li, Yong-Yi Wang, Zheng-An Wang +1Efficient Inference Inference-Time Optimization
Beijing Key Laboratory of Fault-Tolerant Quantum Computing, Beijing Academy of Quantum Information Sciences, Beijing, China · Beijing National Laboratory for Condensed Matter Physics, Institute of Physics, CAS, Beijing, China · Beijing Key Laboratory of Advanced Quantum Technology, Beijing, China +1
A Fresh Look at Lamarckian Evolution and the Baldwin Effect
May 27, 2026Inès Benito, Johannes F. Lutzeyer, Benjamin DoerrEvolutionary Optimization Combinatorial Optimization
Laboratoire d’Informatique (LIX), CNRS, École Polytechnique, Institut Polytechnique de Paris, France
An Enhanced Large Neighborhood Search Approach for the Capacitated Facility Location Problem with Incompatible Customers
May 27, 2026Ida Gjergji, Lucas Kletzander, Nysret Musliu +1Metaheuristic Optimization Combinatorial Optimization
DBAI, TU Wien, Austria · University of Udine, Italy
DynaSchedBench: Calibrated Dynamic Scheduling Benchmarks and Observability Paradox in LLM-based Scheduling Agents
May 26, 2026Shijie Cao, Yuan Yuan, Jing LiuLLM Agent Evaluation Combinatorial Optimization
School of Computer Science and Engineering, Beihang University, Beijing 100191, China · Shenzhen Loop Area Institute, Shenzhen, China · Qingdao Research Institute, Beihang University +3
Developing a Totally Unimodular Linear Program for Optimal Conformance Checking: When and Why It Complements A*
May 26, 2026Izack CohenAlgorithm Selection Process Mining
aFaculty of Engineering, Bar-Ilan University, Ramat Gan, Israel
Adversarial Training for Robust Coverage Network under Worst-case Facility Losses
May 26, 2026Changhao Miao, Yuntian Zhang, Tongyu Wu +2Adversarial Training Combinatorial Optimization
State Key Laboratory of Autonomous Intelligent Unmanned Systems, Beijing Institute of Technology, Beijing 100081, China · Department of Computer, Control and Management Engineering “Antonio Ruberti”, Sapienza University of Rome, Rome, 00185, Italy · School of AI, Beijing Institute of Technology, Beijing 100081, China

Jun 8, 2026, cs.NEJ/K move · Enter open · S save

Local Search on Vertex Coloring for Bipartite Graphs

Johanna Gasse

Fachgebiet Algorithm Engineering der Digital-Engineering-Fakultät der Universität Potsdam

Combinatorial Optimization Local Search

Open paper AskPDF arXiv

Local search is a well-known heuristic method used in optimization. In this thesis, we explore its capabilities on the vertex coloring problem, an

NP

-hard problem with relevance in both theoretical analysis and practical application. To recognize limitations in the applicability of local search of the vertex coloring problem, we analyze local search landscapes on differently-structured bipartite graphs. We identify structures that ensure only global optima can exist as well as ones that enable the existence of non-global local optima, showing that on general bipartite graphs, it is possible for local search to return arbitrarily bad results. Further, we analyze the capabilities of local search on graphs where a local optimum can be found. To do so, we introduce a gray-box local search mutation operator that removes less frequent colors with higher probability and prove that it finds an optimal coloring on complete bipartite graphs in an expected run time of

Θ(n \log n)

. This is a drastic improvement to the exponential tun time of the black-box Random Local Search, showing that gray-box mutation operators can improve the run time of local search.

Momentum

Related topics

Latest papers 277