Search Results - subject:"knapsack constraint"

Improved approximation algorithms for k-submodular maximization under a knapsack constraint

Ha, Dung T. K.; Pham, Canh V.; Tran, Tan D. - In: Computers & operations research : an international journal 161 (2024), pp. 1-14

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014559235

Constant approximation for fault-tolerant median problems via iterative rounding

Deng, Shichuan - In: Operations research letters 50 (2022) 4, pp. 384-390

Persistent link: https://ebvufind01.dmz1.zbw.eu/10013364119

A refined analysis of submodular greedy

Kulik, Ariel; Schwartz, Roy; Shachnai, Hadas - In: Operations research letters 49 (2021) 4, pp. 507-514

Persistent link: https://ebvufind01.dmz1.zbw.eu/10012649022

A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM

CORDONE, ROBERTO; TRUBIAN, MARCO - In: Asia-Pacific Journal of Operational Research (APJOR) 25 (2008) 03, pp. 373-391

The Knapsack Node Weighted Steiner Tree Problem (KNWSTP) is a generalization of the Steiner Tree Problem on graphs, which takes into account the classical cost function defined on the edges, as well as a prize function defined on the vertices and a limit on the size of the solution. It has...

Persistent link: https://ebvufind01.dmz1.zbw.eu/10005047130

On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0–1 knapsack constraint

Escudero, Laureano; Garín, Araceli; Pérez, Gloria - In: TOP: An Official Journal of the Spanish Society of … 7 (1999) 1, pp. 145-153

Persistent link: https://ebvufind01.dmz1.zbw.eu/10005598298