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
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks
- \(k\)-interchange heuristic as an optimization procedure for material handling applications
- Resolution search
- MINTO, a Mixed INTeger Optimizer
- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
- Exact solution procedures for the balanced unidirectional cyclic layout problem
- Polytopes related to interval vectors and incidence matrices
- A dynamic model of controlling invasive species
- Lifting facets of the cut polytope
- Batch scheduling to minimize total completion time
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
- Foundation-penalty cuts for mixed-integer programs.
- Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs
- Mathematical models for applying cell suppression methodology in statistical data protection.
- Nodes selection strategy in cooperative tracking problem
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- Solving the car sequencing problem via branch \& bound
- The complexity of multidimensional periodic scheduling
- Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
- A model for the capacitated \(p\)-facility location problem in global environments
- Two-echelon, multi-commodity supply chain network design with mode selection, lead-times and inventory costs
- Optimizing nuclear power plant refueling with mixed-integer programming
- An optimization framework for ``build-or-buy decisions in software architecture
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- A new filled function method for nonlinear integer programming problem
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- On the directed hop-constrained shortest path problem
- Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Nonlinear integer programming by Darwin and Boltzmann mixed strategy
- A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
- An exact solution framework for the multiple gradual cover location problem
- Stochastic set packing problem
- Graph imperfection. I
- Partial convexification cuts for 0--1 mixed-integer programs
- Applying the minimax criterion in stochastic recourse programs
- Tighter representations for set partitioning problems
- Point of presence design in internet protocol networks with performance guarantees
- Multi-objective design of team oriented assembly systems.
- On the adjustment problem for linear programs
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint
- Facets of the \((s,t)-p\)-path polytope
- An improved Lagrangian relaxation and dual ascent approach to facility 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)
