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.
- 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)
- A greedy approximation for minimum connected dominating sets (Q706637) (← links)
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
- Stochastic set packing problem (Q713096) (← links)
- Differential approximation schemes for half-product related functions and their scheduling applications (Q729806) (← links)
- Approximability issues for unconstrained and constrained maximization of half-product related functions (Q730001) (← links)
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522) (← links)
- Optimal control on a graph with application to train scheduling problems (Q753655) (← links)
- Railway scheduling by network optimization (Q753674) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347) (← links)
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (Q814246) (← links)
- A sensitivity analysis of matching coin game strategies (Q814263) (← links)
- An alternative formulation for certain fuzzy set-covering problems (Q815344) (← links)
- Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
- Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid (Q817555) (← links)
- An exact algorithm for the knapsack sharing problem with common items (Q817562) (← links)
- A partial enumeration algorithm for pure nonlinear integer programming (Q838194) (← links)
- Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems (Q852995) (← links)
- Vote trading in public elections (Q855754) (← links)
- On separating cover inequalities for the multidimensional knapsack problem (Q858283) (← links)
- A heuristic genetic algorithm for product portfolio planning (Q858285) (← links)
- Exact algorithms for procurement problems under a total quantity discount structure (Q859947) (← links)