Copertina

Distributed Recursion Revisited

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Zhang, Wei-Yang, Dong, Feng-Lian, Wei, Zhi-Wei, Wang, Yan-Ru, Xu, Ze-Jin, Chen, Wei-Kun, Dai, Yu-Hong
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 90C59
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
di: Chen, Wei-Kun, et al.
Pubblicazione: (2024)

An efficient branch-and-cut approach for the sequential competitive facility location problem under partially binary rule
di: Guo, Yu-Qi, et al.
Pubblicazione: (2025)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
di: Halbig, Katrin, et al.
Pubblicazione: (2024)

Optimal routing and transmission strategies for UAV reconnaissance missions with detection threats
di: Badenbroek, Riley, et al.
Pubblicazione: (2024)

Perpertual Coupled Simulated Annealing for Continuous Optimization
di: Gonçalves-e-Silva, Kayo, et al.
Pubblicazione: (2018)

Exploiting Overlap Information in Chance-constrained Program with Random Right-hand Side
di: Lv, Wei, et al.
Pubblicazione: (2024)

Presolving and cutting planes for the generalized maximal covering location problem
di: Lv, Wei, et al.
Pubblicazione: (2024)

CHAP: A Hybrid GPU-CPU Heuristic for MIP
di: Tjusila, Gennesaret Kharistio, et al.
Pubblicazione: (2026)

A solution procedure for minimizing total completion time in a parallel-batching environment
di: Alfieri, Arianna, et al.
Pubblicazione: (2020)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
di: Yang, Dominic, et al.
Pubblicazione: (2025)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
di: Borges, Jennifer C., et al.
Pubblicazione: (2026)

An efficient branch-and-cut algorithm for the multiple probabilistic covering location problem
di: Wang, Yan-Ru, et al.
Pubblicazione: (2025)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
di: Dörfler, Daniel, et al.
Pubblicazione: (2020)

Randomized quasi-Monte Carlo methods for risk-averse stochastic optimization
di: Melnikov, Olena, et al.
Pubblicazione: (2024)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
di: Im, Haesol, et al.
Pubblicazione: (2024)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
di: Qu, Zheng, et al.
Pubblicazione: (2023)

A Canceling Heuristic for the Directed Traveling Salesman Problem
di: Borgwardt, Steffen, et al.
Pubblicazione: (2026)

Metaheuristic algorithms for the induced P-median problem with upgrades
di: Salazar, Sergio, et al.
Pubblicazione: (2026)

A Solution Concept for Convex Vector Optimization Problems based on a User-defined Region of Interest
di: Dörfler, Daniel, et al.
Pubblicazione: (2026)

A priority-driven constructive heuristic for assigning and scheduling spontaneous volunteers in disaster response
di: Sperling, Martina
Pubblicazione: (2026)

Polyhedral approximation of spectrahedral shadows via homogenization
di: Dörfler, Daniel, et al.
Pubblicazione: (2023)

Two-stage heuristic algorithm for a new variant of the multi-compartment vehicle routing problem with stochastic demands
di: Gonçalves-Dosantos, Juan Carlos, et al.
Pubblicazione: (2024)

An ODE approach to multiple choice polynomial programming
di: Shao, Sihong, et al.
Pubblicazione: (2022)

A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
di: Bolusani, Suresh, et al.
Pubblicazione: (2024)

Applying a Random-Key Optimizer on Mixed Integer Programs
di: Chaves, Antonio A., et al.
Pubblicazione: (2026)

A Note on Piecewise Affine Decision Rules for Robust, Stochastic, and Data-Driven Optimization
di: Thomä, Simon, et al.
Pubblicazione: (2024)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
di: Kim, Junyoung, et al.
Pubblicazione: (2024)

Designing Tractable Piecewise Affine Policies for Multi-Stage Adjustable Robust Optimization
di: Thomä, Simon, et al.
Pubblicazione: (2022)

A Surrogate Value Function Formulation for Bilevel Optimization
di: Xu, Mengwei, et al.
Pubblicazione: (2025)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
di: Kempke, Nils-Christian, et al.
Pubblicazione: (2025)

Fast Neighborhood Search Heuristics for the Colored Bin Packing Problem
di: da Silva, Renan F. F., et al.
Pubblicazione: (2023)

Multi-convex Programming for Discrete Latent Factor Models Prototyping
di: Zhu, Hao, et al.
Pubblicazione: (2025)

A divergence-based condition to ensure quantile improvement in black-box global optimization
di: Guilmeau, Thomas, et al.
Pubblicazione: (2024)

MOCVXPY: a CVXPY extension for multiobjective optimization
di: Salomon, Ludovic, et al.
Pubblicazione: (2025)

Simulation-Optimization Approaches for the Network Immunization Problem with Quarantining
di: Hoogervorst, Rowan, et al.
Pubblicazione: (2024)

Memetic Differential Evolution Methods for Semi-Supervised Clustering
di: Mansueto, Pierluigi, et al.
Pubblicazione: (2024)

Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
di: Vodeb, Jaka, et al.
Pubblicazione: (2024)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
di: Zhang, Rui-Jin, et al.
Pubblicazione: (2025)

Proximal Quasi-Newton Method for Composite Optimization over the Stiefel Manifold
di: Wang, Qinsi, et al.
Pubblicazione: (2025)

Revenue Optimization with Price-Sensitive and Interdependent Demand
di: Laasri, Julien, et al.
Pubblicazione: (2025)