On degree sequence optimization

DOI10.1016/j.orl.2020.10.010OpenAlexW3095936346MaRDI QIDQ2661577

Shmuel Onn

Publication date: 7 April 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.05141

zbMATH Keywords

graphinteger programmingcombinatorial optimizationmatchingfactordegree sequence

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Nonlinear discrete optimization. An algorithmic theory
• General factors of graphs
• Matching is as easy as matrix inversion
• Integer Programming with a Fixed Number of Variables
• Minconvex Factors of Prescribed Size in Graphs
• Optimization over Degree Sequences
• On the Swap-Distances of Different Realizations of a Graphical Degree Sequence
• A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
• Subgraphs with prescribed valencies

This page was built for publication: On degree sequence optimization