Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
From MaRDI portal
(Redirected from Publication:3923934)
Cited in
(only showing first 100 items - show all)- A column generation heuristic for a dynamic generalized assignment problem
- Scheduling of corrugated paper production
- A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment
- A compact formulation of the ring loading problem with integer demand splitting
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- Minimum fractional dominating functions and maximum fractional packing functions
- A discrete mechanics approach to dislocation dynamics in BCC crystals
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- Maximization of submodular functions: theory and enumeration algorithms
- A notion of cross-perfect bipartite graphs
- Decomposition, reformulation, and diving in university course timetabling
- Knapsack problems with setups
- Non-linear anonymous pricing combinatorial auctions
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Mathematical models for selection of optimal place and size of connections considering the time-value of money
- On the representability of totally unimodular matrices on bidirected graphs
- On-line fault detection in discrete event systems by Petri nets and integer linear programming
- A fixed interval due-date scheduling problem with earliness and due-date costs
- An intelligent interactive project management support system
- An algorithm for solving quadratic network flow problems
- Using separation algorithms to generate mixed integer model reformulations
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- Improved complexity bounds for location problems on the real line
- A polyhedral approach to edge coloring
- A counterexample to a question of Merikoski and Virtanen on the compounds of unitary matrices
- Vehicle crew scheduling to complete specific tasks and bulk-tasks at depots
- A graph-theoretic heuristic for designing loop-layout manufacturing systems
- A characterization of knapsacks with the max-flow--min-cut property
- Complexity of the closest vector problem in a lattice generated by a (0,1)-matrix
- On the convex hull of feasible solutions to certain combinatorial problems
- Lot-sizing polyhedra with a cardinality constraint
- On tightening cover induced inequalities
- Neural network methods in combinatorial optimization
- A stochastic neural network for resource constrained scheduling
- Vehicle routing problem with trailers
- Properties of some ILP formulations of a class of partitioning problems
- A relation between the knapsack and group knapsack problems
- Adjacency on the constrained assignment problem
- Process planning in a fuzzy environment
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- A robustness approach to uncapacitated network design problems
- Tight linear programming relaxations of uncapacitated p-hub median problems
- An extended formulation approach to the edge-weighted maximal clique problem
- Reducing depot-related costs of large bus operators. A case study in Bangkok
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Optimizing nuclear power plant refueling with mixed-integer programming
- Multi-objective optimization over convex disjunctive feasible sets using reference points
- Combinatorial optimization models for production scheduling in automated manufacturing systems
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- The asymptotic value-to-capacity ratio for the multi-class stochastic knapsack problem
- Minimizing waiting times in integrated fixed interval timetables by upgrading railway tracks
- The complexity of multidimensional periodic scheduling
- Minimal connected enclosures on an embedded planar graph
- Nonlinear integer programming by Darwin and Boltzmann mixed strategy
- A lexicographic approach to bi-objective loading of a flexible assembly system
- Solving the generalised assignment problem using polyhedral results
- HOP: A software tool for production scheduling at Bridgestone/Firestone Off-The-Road
- Economic spare capacity planning for DCS mesh-restorable networks
- A linear and discrete programming framework for representing qualitative knowledge
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
- An exact algorithm for the constraint satisfaction problem: Application to logical inference
- Directed Steiner problems with connectivity constraints
- Experiments with parallel branch-and-bound algorithms for the set covering problem
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- Investment planning for urban roads
- Collapsing and lifting for the cut cone
- Balancing problems in acyclic networks
- A 0-1 goal programming model for scheduling multiple maintenance projects at a copper mine
- MINTO, a Mixed INTeger Optimizer
- Polyhedral structure and properties of a model for layout design
- An algorithm for the planar three-index assignment problem
- Geometric comparison of combinatorial polytopes
- A column generation approach to job grouping for flexible manufacturing systems
- Some applications of nonnegative linear systems: Farkas strikes again
- Partitioning of sequentially ordered systems using linear programming
- Distributed processing of divisible jobs with communication startup costs
- The \(k\)-cardinality assignment problem
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
- Channel allocation in cellular radio networks
- On dominated terms in the general knapsack problem
- Cardinality constrained Boolean quadratic polytope
- A binary integer linear program with multi-criteria and multi-constraint levels
- Solution methods for the balancing of jet turbines
- A model for the capacitated p-facility location problem in global environments
- Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
- Complexity of searching an immobile hider in a graph
- Polyhedral characterizations and perfection of line graphs
- The inverse-parametric knapsack problem
- Activity nets: A guided tour through some recent developments
- A special class parametric of knapsack problems: Analytic aids and heuristics
- The design of a 0-1 integer optimizer and its application in the Carmen system
- \(k\)-interchange heuristic as an optimization procedure for material handling applications
- Material compatibility constraints for make-to-order production planning.
- Foundation-penalty cuts for mixed-integer programs.
- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
- Designing communication networks for distributed control agents.
- GRASP for set packing problems.
- Loading and scheduling of a flexible assembly system by mixed integer programming.
- Pricing combinatorial auctions.
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)
