Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
From MaRDI portal
Publication:3964325
DOI10.1287/moor.7.4.515zbMath0498.90061OpenAlexW2073127061MaRDI QIDQ3964325
Publication date: 1982
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.7.4.515
Related Items
Siting renewable power generation assets with combinatorial optimisation, Integer linear programming formulations for double roman domination problem, A fast approximation algorithm for the multicovering problem, Tight Approximation Bounds for Maximum Multi-coverage, (Total) vector domination for graphs with bounded branchwidth, Robust efficiency measures for linear knapsack problem variants, A primal-dual approximation algorithm for generalized Steiner network problems, Hybrid column generation for large-size covering integer programs: application to transportation planning, Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms, Algorithms for covering multiple submodular constraints and applications, Partial Resampling to Approximate Covering Integer Programs, Rounding algorithms for covering problems, Approximating set multi-covers, Local ratio method on partial set multi-cover, Approximation algorithm for the stochastic prize-collecting set multicover problem, Domination parameters with number 2: interrelations and algorithmic consequences, Set selection under explorable stochastic uncertainty via covering techniques, An auxiliary function method for global minimization in integer programming, Algorithmic results in Roman dominating functions on graphs, Approximating covering integer programs with multiplicity constraints, Two sensitivity theorems in fuzzy integer programming., The multidimensional 0-1 knapsack problem: an overview., Approximation schemes for deal splitting and covering integer programs with multiplicity constraints, Approximating integer programs with positive right-hand sides, Primal Heuristics for Branch and Price: The Assets of Diving Methods, On approximation of the submodular set cover problem, Approximation algorithm for partial set multicover versus full set multicover, On the computational complexity of measuring global stability of banking networks, Discrete optimization algorithms and problems of decision making in a fuzzy environment, Admission control with advance reservations in simple networks, Randomized approximation of bounded multicovering problems, Approximation algorithm for partial positive influence problem in social network, Lower bounds and algorithms for the minimum cardinality bin covering problem, The multicovering problem, Approximation algorithm for the partial set multi-cover problem, A critical review of discrete filled function methods in solving nonlinear discrete optimization problems, Minimum monopoly in regular and tree graphs, Approximation algorithm for the multicovering problem, A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem, Algorithms of discrete optimization and their application to problems with fuzzy coefficients, A class of generalized greedy algorithms for the multi-knapsack problem, Double vertex-edge domination in graphs: complexity and algorithms, Detecting embedded pure network structures in LP problems, A new approach for approximating node deletion problems, Heuristic methods and applications: A categorized survey, An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition, Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs, An analysis of the greedy algorithm for the submodular set covering problem, Approximating the weight of shallow Steiner trees, Generalized submodular cover problems and applications, Approximation algorithms for covering/packing integer programs, An improved approximation algorithm for vertex cover with hard capacities, Local majorities, coalitions and monopolies in graphs: A review, Extracting embedded generalized networks from linear programming problems, Tight approximation bounds for maximum multi-coverage, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
