Pages that link to "Item:Q1295954"

The following pages link to The 0-1 knapsack problem with a single continuous variable (Q1295954):

Displaying 40 items.

• Continuous knapsack sets with divisible capacities (Q263180) (← links)
• Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets (Q312703) (← links)
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687) (← links)
• Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable (Q489742) (← links)
• Maximizing a class of submodular utility functions (Q543403) (← links)
• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
• The newsvendor problem with capacitated suppliers and quantity discounts (Q724067) (← links)
• Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• A cutting plane algorithm for the capacitated facility location problem (Q842775) (← links)
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
• Lifting two-integer knapsack inequalities (Q868448) (← links)
• Mingling: mixed-integer rounding with bounds (Q964180) (← links)
• Models and methods for capacitated lot-sizing problems (Q1029562) (← links)
• On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• On the relative strength of different generalizations of split cuts (Q1751106) (← links)
• Multi-commodity variable upper bound flow models (Q1751124) (← links)
• Facets for continuous multi-mixing set with general coefficients and bounded integer variables (Q1751241) (← links)
• A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
• Sequence independent lifting for a set of submodular maximization problems (Q2097631) (← links)
• A polyhedral approach to least cost influence maximization in social networks (Q2111478) (← links)
• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables (Q2183195) (← links)
• Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
• Lifting for mixed integer programs with variable upper bounds (Q2345614) (← links)
• \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set (Q2429470) (← links)
• The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
• Polyhedral properties for the intersection of two knapsacks (Q2476986) (← links)
• Description of 2-integer continuous knapsack polyhedra (Q2506817) (← links)
• Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
• Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable (Q2815436) (← links)
• Least-Cost Influence Maximization on Social Networks (Q3386763) (← links)
• Sequence Independent Lifting for the Set of Submodular Maximization Problem (Q5041759) (← links)
• A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management (Q5129213) (← links)
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
• Flow pack facets of the single node fixed-charge flow polytope (Q5952067) (← links)
• Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
• Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems (Q6164359) (← links)