A note on valid inequalities for PageRank optimization with edge selection constraints

DOI10.1016/J.DAM.2025.12.023MaRDI QIDQ6854652zbMATH OpenFDO

Authors Shang-Ru Yang, Yung-Han Liao, Chih-Ching Chien, Hao-Hsiang Wu

Publication date 24 February 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.12.023

zbMATH Keywords

exact methodinteger programmingPageRank optimizationvalid inequality

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Integer programming (90C10)

Cites work

• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• A Survey on PageRank Computing
• Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
• Ergodic Control and Polyhedral Approaches to PageRank Optimization
• Facets of the knapsack polytope
• Facets of the Knapsack Polytope From Minimal Covers
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• Integer Programming
• Introduction to Stochastic Programming
• Lectures on Stochastic Programming
• Manipulation-Resistant Reputations Using Hitting Time
• Maximizing PageRank via outlinks
• Mixed-integer nonlinear optimization
• Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
• On the approximability of the link building problem
• PageRank beyond the web
• PageRank optimization by edge selection
• PageRank optimization in polynomial time by stochastic shortest path reformulation
• Sequence Independent Lifting for Mixed-Integer Programming
• Sequence independent lifting in mixed integer programming
• Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
• The Effect of New Links on Google Pagerank
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• The sample average approximation method for stochastic discrete optimization
• Valid Inequalities and Superadditivity for 0–1 Integer Programs

This page was built for publication: A note on valid inequalities for PageRank optimization with edge selection constraints

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