Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data

Cited in

(65)

Double vertex-edge domination in graphs: complexity and algorithms
A 1/2-approximation algorithm for maximum interval multi-cover
Approximating covering integer programs with multiplicity constraints
Algorithms for covering multiple submodular constraints and applications
A primal-dual approximation algorithm for generalized Steiner network problems
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
Approximation algorithm for partial set multicover versus full set multicover
An auxiliary function method for global minimization in integer programming
A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
Bounding the price-of-fair-sharing using knapsack-cover constraints to guide near-optimal cost-recovery algorithms
Detecting embedded pure network structures in LP problems
Randomized approximation of bounded multicovering problems
An improved approximation algorithm for vertex cover with hard capacities
Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
Online multiset submodular cover
A fast approximation algorithm for the multicovering problem
Two sensitivity theorems in fuzzy integer programming.
Approximation algorithm for the multicovering problem
Integer linear programming formulations for double Roman domination problem
(Total) vector domination for graphs with bounded branchwidth
Discrete optimization algorithms and problems of decision making in a fuzzy environment
Approximating the weight of shallow Steiner trees
Extracting embedded generalized networks from linear programming problems
Diversity and freshness-aware regret minimizing set queries
Lower bounds and algorithms for the minimum cardinality bin covering problem
Heuristic methods and applications: A categorized survey
Tight approximation bounds for maximum multi-coverage
Admission control with advance reservations in simple networks
Minimum monopoly in regular and tree graphs
Tight approximation bounds for maximum multi-coverage
Rounding algorithms for covering problems
On constrained minimum weight edge covers with applications to emergency planning
Generalized submodular cover problems and applications
Local majorities, coalitions and monopolies in graphs: A review
Local ratio method on partial set multi-cover
Approximation algorithms for covering/packing integer programs
Approximation algorithm for the partial set multi-cover problem
An analysis of the greedy algorithm for the submodular set covering problem
On inner independence systems
Set selection under explorable stochastic uncertainty via covering techniques
Approximation algorithm for the stochastic prize-collecting set multicover problem
On approximation of the submodular set cover problem
Robust efficiency measures for linear knapsack problem variants
Hybrid column generation for large-size covering integer programs: application to transportation planning
Primal Heuristics for Branch and Price: The Assets of Diving Methods
An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition
Algorithmic results in Roman dominating functions on graphs
Algorithms of discrete optimization and their application to problems with fuzzy coefficients
On the computational complexity of measuring global stability of banking networks
The multidimensional 0-1 knapsack problem: an overview.
Domination parameters with number 2: interrelations and algorithmic consequences
On generalizations of partial scenario set cover
Approximating set multi-covers
The multidimensional 0-1 knapsack problem -- bounds and computational aspects
The multicovering problem
On approximating partial scenario set cover
Towards strong regret minimization sets: balancing freshness and diversity in data selection
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
Approximating integer programs with positive right-hand sides
Siting renewable power generation assets with combinatorial optimisation
A new approach for approximating node deletion problems
Approximation algorithm for partial positive influence problem in social network
A class of generalized greedy algorithms for the multi-knapsack problem
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem

This page was built for publication: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data

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