Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
From MaRDI portal
Publication:3923934
Cited in
(only showing first 100 items - show all)- A theory of complexity for continuous time systems
- The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
- Improved approximation of maximum vertex cover
- Robustness analysis of elementary flux modes generated by column generation
- An exact solution framework for the multiple gradual cover location problem
- Polymatroids and mean-risk minimization in discrete optimization
- Cardinality-restricted chains and antichains in partially ordered sets
- Submodular function minimization and polarity
- A framework for solving mixed-integer semidefinite programs
- A polyhedral approach for a constrained quadratic 0-1 problem
- The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
- Solving sequential knapsack problems
- Real-time freight locomotive rescheduling and uncovered train detection during disruption
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- Point of presence design in internet protocol networks with performance guarantees
- The \(k\)-cardinality assignment problem
- Coloring planar Toeplitz graphs and the stable set polytope.
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables
- The inverse-parametric knapsack problem
- A special class parametric of knapsack problems: Analytic aids and heuristics
- Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line
- A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing
- A multi-period machine assignment problem
- Material compatibility constraints for make-to-order production planning.
- Non-standard approaches to integer programming
- Minimum fractional dominating functions and maximum fractional packing functions
- Polytopes related to interval vectors and incidence matrices
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
- Exact solutions to a class of stochastic generalized assignment problems
- On the representability of totally unimodular matrices on bidirected graphs
- Monge matrices make maximization manageable
- Optimization with binet matrices
- Mathematical models for optimal usage of tributary cards in wavelength assignment for DWDM ring networks
- A compact formulation of the ring loading problem with integer demand splitting
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
- The cable trench problem: Combining the shortest path and minimum spanning tree problems
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms
- How to allocate hard candies fairly
- \((r|p)\)-centroid problems on networks with vertex and edge demand
- An optimization framework for ``build-or-buy decisions in software architecture
- Totally tight Chvatal-Gomory cuts
- Constrained 0-1 quadratic programming: basic approaches and extensions
- On a class of mixed-integer sets with a single integer variable
- A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints
- An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6.
- A simple finite cutting plane algorithm for integer programs
- Pseudo-Boolean optimization
- Lifting facets of the cut polytope
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
- On the linear description of the 3-cycle polytope
- Video distribution under multiple constraints
- Solving a fuzzy set-covering problem
- A relation between the knapsack and group knapsack problems
- The complexity of multidimensional periodic scheduling
- A note on the MIR closure
- On tightening cover induced inequalities
- Lower bounds for the two-stage uncapacitated facility location problem
- Pareto optimization for subset selection with dynamic cost constraints
- Neural network methods in combinatorial optimization
- Designing communication networks for distributed control agents.
- Efficient solution generation for multiple objective linear programming based on extreme ray generation method
- The multi-level uncapacitated facility location problem is not submodular
- A polynomially solvable special case of the unbounded knapsack problem
- Out of order quantifier elimination for standard quantified linear programs
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
- Rerouting tunnels for MPLS network resource optimization
- An algorithm for the planar three-index assignment problem
- Simultaneous loading, routing, and assembly plan selection in a flexible assembly system
- Constraint generation approaches for submodular function maximization leveraging graph properties
- An alternative formulation for certain fuzzy set-covering problems
- Multi-objective optimization over convex disjunctive feasible sets using reference points
- Reducing depot-related costs of large bus operators. A case study in Bangkok
- Minimizing waiting times in integrated fixed interval timetables by upgrading railway tracks
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- A characterization of knapsacks with the max-flow--min-cut property
- Approximation algorithms for the Euclidean bipartite TSP
- Unimodularity of the Clar number problem
- Container shipping service selection and cargo routing with transshipment limits
- Graph imperfection. I
- A column generation approach to job grouping for flexible manufacturing systems
- Comparative approaches to equipment scheduling in high volume factories
- Using penalty function and tabu search to solve cell formation problems with fixed cell cost.
- On polynomial complexity of a stochastic algorithm for mixed zero-one programs.
- Vehicle routing problem with trailers
- Tight linear programming relaxations of uncapacitated p-hub median problems
- A fixed interval due-date scheduling problem with earliness and due-date costs
- Conley's spectral sequence via the sweeping algorithm
- Resolution search
- Best compromise solution for a new multiobjective scheduling problem
- Local search inequalities
- Multi-commodity variable upper bound flow models
- Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
- Valid inequalities for the single arc design problem with set-ups
- Multicommodity flows and Benders decomposition for restricted continuous location problems
This page was built for publication: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3923934)
