A criterion space search feasibility pump heuristic for solving maximum multiplicative programs

Ashim Khanal & Hadi Charkhgard

Discrete Optimization2025https://doi.org/10.1016/j.disopt.2025.100903article
AJG 2
Weight
0.50

What the paper says

No abstract available.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1016/j.disopt.2025.100903

Or copy a formatted citation

@article{ashim2025,
  title        = {{A criterion space search feasibility pump heuristic for solving maximum multiplicative programs}},
  author       = {Ashim Khanal & Hadi Charkhgard},
  journal      = {Discrete Optimization},
  year         = {2025},
  doi          = {https://doi.org/https://doi.org/10.1016/j.disopt.2025.100903},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

A criterion space search feasibility pump heuristic for solving maximum multiplicative programs

Flags are reviewed by the Arbiter methodology team within 5 business days.


Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.