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.
- 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)
- Unimodularity of the Clar number problem (Q861006) (← links)
- Locating landfills--optimization vs. reality (Q864021) (← links)
- Lower bounds for the two-stage uncapacitated facility location problem (Q864032) (← links)
- Multiprogramming genetic algorithm for optimization problems with permutation property (Q870194) (← links)
- A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing (Q872122) (← links)
- The stable set polytope of icosahedral graphs (Q898118) (← links)
- A computationally efficient robust tube based MPC for linear switched systems (Q901258) (← links)
- Lifting facets of the cut polytope (Q923115) (← links)
- A note on the MIR closure (Q924876) (← links)
- Bounds on the size of branch-and-bound proofs for integer knapsacks (Q924879) (← links)
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
- Lagrangian approaches for a class of matching problems in computational biology (Q929184) (← links)
- Goal programming in the context of the assignment problem and a computationally effective solution method (Q929411) (← links)
- Complexity of local search for the \(p\)-median problem (Q932191) (← links)
- Solving the car sequencing problem via branch \& bound (Q932220) (← links)
- A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
- Polymatroids and mean-risk minimization in discrete optimization (Q957370) (← links)
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter (Q958548) (← links)
- Facets of the \((s,t)-p\)-path polytope (Q967368) (← links)
- Mathematical models for optimal usage of tributary cards in wavelength assignment for DWDM ring networks (Q969908) (← links)
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts (Q976440) (← links)
- Optimization and analysis of the profitability of tariff structures with two-part tariffs (Q976514) (← links)
- Conley's spectral sequence via the sweeping algorithm (Q989093) (← links)
- A column generation heuristic for a dynamic generalized assignment problem (Q1010279) (← links)
- Scheduling of corrugated paper production (Q1011222) (← links)
- A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment (Q1011268) (← links)
- A compact formulation of the ring loading problem with integer demand splitting (Q1015309) (← links)
- Cutting plane algorithms for the inverse mixed integer linear programming problem (Q1015310) (← links)