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.
- Submodular function minimization and polarity (Q2097629) (← links)
- An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions (Q2183220) (← links)
- A family of inequalities valid for the robust single machine scheduling polyhedron (Q2270446) (← links)
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413) (← links)
- Feasibility checking in Horn constraint systems through a reduction based approach (Q2344728) (← links)
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
- Broadcasting in unstructured peer-to-peer overlay networks (Q2368962) (← links)
- On the adjustment problem for linear programs (Q2370336) (← links)
- Adaptive modeling, adaptive data assimilation and adaptive sampling (Q2371208) (← links)
- A pegging approach to the precedence-constrained knapsack problem (Q2371351) (← links)
- New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
- Optimal multicast route packing (Q2378485) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- Solving a capacitated hub location problem (Q2384615) (← links)
- Point of presence design in internet protocol networks with performance guarantees (Q2387306) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- A polyhedral approach for a constrained quadratic 0-1 problem (Q2387431) (← links)
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
- Selection among ranked projects under segmentation, policy and logical constraints (Q2426570) (← links)
- A dynamic model of controlling invasive species (Q2428966) (← links)
- Modeling and solving a crew assignment problem in air transportation (Q2432845) (← links)
- Seasonal clustering technique for time series data (Q2432858) (← links)
- Redesigning a warehouse network (Q2432895) (← links)
- Polyhedral results for the bipartite induced subgraph problem (Q2433802) (← links)
- A mixed R{\&}D projects and securities portfolio selection model (Q2455632) (← links)
- Out of order quantifier elimination for standard quantified linear programs (Q2456614) (← links)
- Multi-period capacitated location with modular equipments (Q2456628) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Constraint-based optimization and utility elicitation using the minimax decision criterion (Q2457617) (← links)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem (Q2462550) (← links)
- How to allocate hard candies fairly (Q2463574) (← links)
- A mathematical programming approach to key-based election analysis (Q2466589) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem (Q2467447) (← links)
- Optimization with binet matrices (Q2467475) (← links)
- A multiple server location-allocation model for service system design (Q2468482) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- Rerouting tunnels for MPLS network resource optimization (Q2469604) (← links)
- Balancedness of edge covering games (Q2471286) (← links)
- Integer programming approach to reactive scheduling in make-to-order manufacturing (Q2473247) (← links)
- Classification of orthogonal arrays by integer programming (Q2475747) (← links)
- Production and inventory management under multiple resource constraints (Q2476693) (← links)
- An optimization framework for ``build-or-buy'' decisions in software architecture (Q2482365) (← links)
- Exact solution procedures for the balanced unidirectional cyclic layout problem (Q2482739) (← links)
- Beam search heuristic to solve stochastic integer problems under probabilistic constraints (Q2484339) (← links)
- Integer programming approach to production scheduling for make-to-order manufacturing (Q2486790) (← links)
- Approximation algorithms for the Euclidean bipartite TSP (Q2488237) (← links)
- Generation of classes of robust periodic railway timetables (Q2489288) (← links)