No article text was recorded for this version.
divide and conquer optimization
Version 1 of 130 papers33 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Select and Optimize: Learning to solve large-scale TSP instances
- Blog: Energy Efficient Resource Allocation in UAV-Enabled Mobile Edge Computing Networks
- Blog: Dynamic Virtual Resource Allocation for 5G and Beyond Network Slicing
- Blog: Hybrid Memetic Search for Electric Vehicle Routing With Time Windows, Simultaneous Pickup-Delivery, and Partial Recharges
- Blog: Rates of Convergence for Quasi-Additive Smooth Euclidean Functionals and Application to Combinatorial Optimization Problems
- Blog: J$\text{C}^{5}$A: Service Delay Minimization for Aerial MEC-Assisted Industrial Cyber-Physical Systems
- Blog: Relaxations for multi-period optimal power flow problems with discrete decision variables
- Blog: New solutions based on the generalized eigenvalue problem for the data collaboration analysis
- Blog: Fast approximate L∞ minimization: Speeding up robust regression
- Blog: Automatic Construction of Parallel Portfolios via Explicit Instance Grouping
- Blog: Decomposition Methods for Solving Scheduling Problem Using Answer Set Programming
- Blog: Robust co-design framework for buildings operated by predictive control
- Blog: Efficient safe learning for controller tuning with experimental validation
- Blog: Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
- Blog: Optimistic Games for Combinatorial Bayesian Optimization with Applications to Protein Design
- Blog: On Solving Boolean Multilevel Optimization Problemse
- Blog: Optimal routing of energy-aware vehicles in networks with inhomogeneous charging nodes
- Blog: Bounds for Multistage Mixed-Integer Distributionally Robust Optimization
- Blog: Outlier-Robust Multi-Model Fitting on Quantum Annealers
- Blog: Imitation Improvement Learning for Large-Scale Capacitated Vehicle Routing Problems
- Blog: Community-Based Trip Sharing for Urban Commuting
- Blog: A Distributed Operational Method for Convex Hull Pricing Based on the Alternating Direction Method of Multipliers with Dantzig–Wolfe and Benders Decomposition
- Blog: Efficient sample selection for safe learning*
- Blog: Diverse Planning for UAV Control and Remote Sensing
- Blog: ICD2S: A Hybrid Ising-Classical-Machines Data-Driven QUBO Solver Method
- Blog: Check-In Desk Scheduling Optimisation at CDG International Airport
- Blog: Optimising Training for Service Delivery
- Blog: Reinforcement Learning-Based Resource Allocation and Energy Efficiency Optimization for a Space–Air–Ground-Integrated Network
- Blog: Quanto: optimizing quantum circuits with automatic generation of circuit identities
- Blog: Planned lead times optimization for multi-level assembly systems under uncertainties
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_divide_and_conquer_optimization_0f7e44c8,
title = {divide and conquer optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/divide-and-conquer-optimization/rdr_0f7e44c8240c40209d58921851973f93},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_divide_and_conquer_optimization_0f7e44c8_v1,
title = {divide and conquer optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/divide-and-conquer-optimization/rdr_0f7e44c8240c40209d58921851973f93/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}