Pages that link to "Item:Q3923934"
From MaRDI portal
The following pages link to Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms (Q3923934):
Displayed 22 items.
- The shortest path problem with forbidden paths (Q146692) (← links)
- Robustness analysis of elementary flux modes generated by column generation (Q254086) (← links)
- Exact computation of max weighted score estimators (Q295700) (← links)
- Individuals, populations and fluid approximations: a Petri net based perspective (Q313335) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- The data transfer problem in a system of systems (Q319366) (← links)
- A branch-price-and-cut algorithm for the minimum evolution problem (Q319451) (← links)
- A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes (Q319637) (← links)
- A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
- Multi-level facility location as the maximization of a submodular set function (Q320143) (← links)
- Models and algorithms for network reduction (Q320811) (← links)
- Obtaining cell counts for contingency tables from rounded conditional frequencies (Q322408) (← links)
- The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties (Q322558) (← links)
- Lifted Euclidean inequalities for the integer single node flow set with upper bounds (Q322621) (← links)
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
- Strengthening the reliability fixed-charge location model using clique constraints (Q337553) (← links)
- \((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626) (← links)
- Algorithms and implementation of a set partitioning approach for modular machining line design (Q339661) (← links)
- Nodes selection strategy in cooperative tracking problem (Q340644) (← links)
- Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty (Q408396) (← links)
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets (Q427901) (← links)