Pages that link to "Item:Q1121763"
From MaRDI portal
The following pages link to Submodularity and valid inequalities in capacitated fixed charge networks (Q1121763):
Displaying 24 items.
- On the transportation problem with market choice (Q479018) (← links)
- Maximizing a class of submodular utility functions (Q543403) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
- Valid inequalities and separation for uncapacitated fixed charge networks (Q1064271) (← links)
- Low earth orbit satellite based communication systems -- research opportunities (Q1278815) (← links)
- Capacitated facility location: Separation algorithms and computational experience (Q1290613) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Multi-commodity variable upper bound flow models (Q1751124) (← links)
- More for less method to minimize the unit transportation cost of a capacitated transportation problem with bounds on rim conditions (Q1788849) (← links)
- Valid inequalities and separation for capacitated fixed charge flow problems (Q1962074) (← links)
- Submodular function minimization and polarity (Q2097629) (← links)
- Sequence independent lifting for a set of submodular maximization problems (Q2097631) (← links)
- Valid inequalities for mixed-integer programmes with fixed charges on sets of variables (Q2183195) (← links)
- Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope (Q2183218) (← links)
- Erratum: ``Submodularity and valid inequalities in capacitated fixed charge networks'' (Q2314415) (← links)
- Fixed-charge transportation on a path: optimization, LP formulations and separation (Q2434997) (← links)
- Sequence Independent Lifting for the Set of Submodular Maximization Problem (Q5041759) (← links)
- Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem (Q5355207) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
- Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)
- Supermodularity and valid inequalities for quadratic optimization with indicators (Q6165587) (← links)
- Constrained optimization of rank-one functions with indicator variables (Q6634534) (← links)
