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 50 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)
- Sell or hold: A simple two-stage stochastic combinatorial optimization problem (Q435735) (← links)
- Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing (Q439361) (← links)
- Operations research in the space industry (Q439363) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- A flexible ILP formulation for hierarchical clustering (Q511770) (← links)
- A column generation based algorithm for the robust graph coloring problem (Q516837) (← links)
- Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms (Q541729) (← links)
- Climate change and optimal energy technology R\&D policy (Q545123) (← links)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
- Video distribution under multiple constraints (Q551203) (← links)
- Solving a fuzzy set-covering problem (Q557144) (← links)
- An exact penalty function approach for nonlinear integer programming problems (Q580179) (← links)
- ATM VP-based network design (Q596263) (← links)
- Size-constrained graph partitioning polytopes (Q607006) (← links)
- Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs (Q613341) (← links)
- On a class of mixed-integer sets with a single integer variable (Q614040) (← links)
- A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization (Q621968) (← links)
- Buyer-supplier games: optimization over the core (Q627118) (← links)
- Graph coloring with rejection (Q632809) (← links)
- Polytopes related to interval vectors and incidence matrices (Q636259) (← links)
- Lifting cover inequalities for the precedence-constrained knapsack problem (Q674439) (← links)
- Resolution search (Q674925) (← links)
- Solving sequential knapsack problems (Q688211) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6. (Q703240) (← links)