Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
From MaRDI portal
Publication:3923934
Cited in
(only showing first 100 items - show all)- Goal programming in the context of the assignment problem and a computationally effective solution method
- Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems
- Solution methods for the balancing of jet turbines
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
- 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
- Hybrid genetic algorithm for optimization problems with permutation property
- Branch and cut methods for network optimization
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
- Probabilistic partial set covering with an oracle for chance constraints
- A branch-and-price algorithm for the Steiner tree packing problem.
- Adjacency on the constrained assignment problem
- Optimal control on a graph with application to train scheduling problems
- Optimization with binet matrices
- A note on the MIR closure
- On solving the continuous data editing problem
- A lexicographic approach to bi-objective loading of a flexible assembly system
- Solving the generalised assignment problem using polyhedral results
- Using penalty function and tabu search to solve cell formation problems with fixed cell cost.
- Cardinality-restricted chains and antichains in partially ordered sets
- A sensitivity analysis of matching coin game strategies
- Process planning in a fuzzy environment
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts
- Upper and lower bounding strategies for the generalized minimum spanning tree problem
- Optimal multicast route packing
- Neural network methods in combinatorial optimization
- Distributed processing of divisible jobs with communication startup costs
- Material compatibility constraints for make-to-order production planning.
- A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing
- Multiprogramming genetic algorithm for optimization problems with permutation property
- Integer programming approach to production scheduling for make-to-order manufacturing
- Seasonal clustering technique for time series data
- The stable set polytope of icosahedral graphs
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- Channel allocation in cellular radio networks
- Partitioning of sequentially ordered systems using linear programming
- Container vessel scheduling with bi-directional flows
- Differential approximation schemes for half-product related functions and their scheduling applications
- Approximability issues for unconstrained and constrained maximization of half-product related functions
- A polyhedral approach to bisubmodular function minimization
- A discrete mechanics approach to dislocation dynamics in BCC crystals
- Mathematical models for optimal usage of tributary cards in wavelength assignment for DWDM ring networks
- Cardinality constrained Boolean quadratic polytope
- Complexity of searching an immobile hider in a graph
- On the linear description of the 3-cycle polytope
- A branch-and-bound method for multicommodity location with balancing requirements
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- Rerouting tunnels for MPLS network resource optimization
- Discrete models for data imputation
- A compact formulation of the ring loading problem with integer demand splitting
- Conley's spectral sequence via the sweeping algorithm
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
- A two-stage stochastic programming approach for multi-activity tour scheduling
- On dominated terms in the general knapsack problem
- A polynomially solvable special case of the unbounded knapsack problem
- On the minors of an incidence matrix and Smith normal form
- A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization
- Lagrangian approaches for a class of matching problems in computational biology
- Buyer-supplier games: optimization over the core
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
- Efficient reformulation for 0-1 programs -- methods and computational results
- Graph coloring with rejection
- Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
- An extended formulation approach to the edge-weighted maximal clique problem
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- An exact penalty function approach for nonlinear integer programming problems
- An algorithm for the planar three-index assignment problem
- A class of web-based facets for the generalized vertex packing problem
- A graph-theoretic heuristic for designing loop-layout manufacturing systems
- A method of transferring polyhedron between the intersection-form and the sum-form
- Sell or hold: A simple two-stage stochastic combinatorial optimization problem
- A bound on the \(k\)-gonality of facets of the hypermetric cone and related complexity problems
- A partial enumeration algorithm for pure nonlinear integer programming
- A robustness approach to uncapacitated network design problems
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- Video distribution under multiple constraints
- Supermodular functions and the complexity of MAX CSP
- On the convex hull of feasible solutions to certain combinatorial problems
- Pareto optimization for subset selection with dynamic cost constraints
- Solving a fuzzy set-covering problem
- A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization
- Real-time freight locomotive rescheduling and uncovered train detection during disruption
- On the representability of totally unimodular matrices on bidirected graphs
- Covering non-uniform hypergraphs
- Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs
- On tightening cover induced inequalities
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms
- A polyhedral approach to edge coloring
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- The design of a 0-1 integer optimizer and its application in the Carmen system
- An approximate algorithm for nonlinear integer programming
- Lower bounds for the two-stage uncapacitated facility location problem
- Solving sequential knapsack problems
- A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints
- The \(k\)-cardinality assignment problem
- Polyhedral characterizations and perfection of line graphs
- Balancing problems in acyclic networks
- A computationally efficient robust tube based MPC for linear switched systems
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design
- Classification of orthogonal arrays by integer programming
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)
