The 0-1 knapsack problem with a single continuous variable

DOI10.1007/S101070050044zbMATH Open0956.90021OpenAlexW1990585107MaRDI QIDQ1295954FDOQ1295954

Authors: Hugues Marchand, Laurence A. Wolsey 

Publication date: 28 June 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050044

Recommendations

• scientific article; zbMATH DE number 2086920
• Computational testing of a separation procedure for the knapsack set with a single continuous variable
• Separation algorithms for 0-1 knapsack polytopes
• On the facets of the mixed-integer knapsack polyhedron
• Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms

zbMATH Keywords

liftingrestrictionvalid inequalitiesmixed 0-1 knapsacks

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Cited In (47)

• Sequence independent lifting for a set of submodular maximization problems
• Title not available (Why is that?)
• Facets for continuous multi-mixing set with general coefficients and bounded integer variables
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
• Continuous knapsack sets with divisible capacities
• Computational testing of a separation procedure for the knapsack set with a single continuous variable
• Lifting for the integer knapsack cover polyhedron
• The continuous knapsack set
• Knapsack polytopes: a survey
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
• Multi-commodity variable upper bound flow models
• Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems
• A computational analysis of lower bounds for big bucket production planning problems
• Sequence Independent Lifting for the Set of Submodular Maximization Problem
• The newsvendor problem with capacitated suppliers and quantity discounts
• Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
• Theoretical challenges towards cutting-plane selection
• Lifting two-integer knapsack inequalities
• A noncompact formulation for job-shop scheduling problems in traffic management
• Polyhedral properties for the intersection of two knapsacks
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• Lifting for mixed integer programs with variable upper bounds
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs
• Least-cost influence maximization on social networks
• Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
• A cutting plane algorithm for the capacitated facility location problem
• The 1-Neighbour Knapsack Problem
• Cover and pack inequalities for (mixed) integer programming
• Models and methods for capacitated lot-sizing problems
• Description of 2-integer continuous knapsack polyhedra
• A polyhedral approach to least cost influence maximization in social networks
• Mingling: mixed-integer rounding with bounds
• Separation algorithms for 0-1 knapsack polytopes
• Flow pack facets of the single node fixed-charge flow polytope
• On the knapsack closure of 0-1 integer linear programs
• Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable
• Sequence independent lifting for mixed integer programs with variable upper bounds
• Cutting planes in integer and mixed integer programming
• Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
• A polyhedral study of the semi-continuous knapsack problem
• On the relative strength of different generalizations of split cuts
• On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
• Maximizing a class of submodular utility functions
• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
• \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
• The multi-item capacitated lot-sizing problem with setup times and shortage costs

This page was built for publication: The 0-1 knapsack problem with a single continuous variable

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