Differentiable discrete optimization using dataless neural networks

DOI10.1007/978-3-031-49614-1_1MaRDI QIDQ6606216zbMATH OpenFDO

Authors Sangram K. Jena, K. Subramani, Alvaro Velasquez

Publication date 16 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49614-1_1

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• A differentiable approach to the maximum independent set problem using dataless neural networks
• An exact bit-parallel algorithm for the maximum clique problem
• Approximating maximum independent sets by excluding subgraphs
• Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
• Exact exponential algorithms.
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Parameterized algorithms
• Parametrized complexity theory.
• Reinforcement learning for combinatorial optimization: a survey

Cited in

(1)

• Advancing discrete optimization: novel approaches with dataless neural networks

This page was built for publication: Differentiable discrete optimization using dataless neural networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606216)