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
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
- Relocation problems arising in conservation biology
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
- Pseudo-Boolean optimization
- Production and inventory management under multiple resource constraints
- A family of inequalities valid for the robust single machine scheduling polyhedron
- Mathematical programming formulations for machine scheduling: A survey
- Approximation algorithms for knapsack problems with cardinality constraints
- Pricing combinatorial auctions.
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- Service network design in freight transportation
- Combinatorial optimization models for production scheduling in automated manufacturing systems
- Deterministic network interdiction
- Selection among ranked projects under segmentation, policy and logical constraints
- Models for representing piecewise linear cost functions
- A characterization of knapsacks with the max-flow--min-cut property
- Optimal project selection when borrowing and lending rates differ
- A discrete dynamic convexized method for nonlinear integer programming
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- Solving a gas-lift optimization problem by dynamic programming
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
- Generalized submodular cover problems and applications
- Unimodularity of the Clar number problem
- Two-stage network constrained robust unit commitment problem
- Vote trading in public elections
- Formulations and exact algorithms for the vehicle routing problem with time windows
- Accelerating column generation for variable sized bin-packing problems
- An integrated cutting stock and sequencing problem
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- Climate change and optimal energy technology R\&D policy
- Properties of some ILP formulations of a class of partitioning problems
- A survey of computational complexity results in systems and control
- Exact computation of max weighted score estimators
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
- The shortest path problem with forbidden paths
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- Maximization of submodular functions: theory and enumeration algorithms
- The asymptotic value-to-capacity ratio for the multi-class stochastic knapsack problem
- On separating cover inequalities for the multidimensional knapsack problem
- A \(0-1\) goal programming model for scheduling multiple maintenance projects at a copper mine
- Using separation algorithms to generate mixed integer model reformulations
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)
