Pages that link to "Item:Q3923934"
From MaRDI portal
The following pages link to Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms (Q3923934):
Displayed 49 items.
- Best compromise solution for a new multiobjective scheduling problem (Q2489291) (← links)
- A new filled function method for nonlinear integer programming problem (Q2489450) (← links)
- Lagrangian duality applied to the vehicle routing problem with time windows (Q2496037) (← links)
- Exact solutions to a class of stochastic generalized assignment problems (Q2496071) (← links)
- Solving a gas-lift optimization problem by dynamic programming (Q2503089) (← links)
- Two-stage network constrained robust unit commitment problem (Q2514777) (← links)
- Comparative approaches to equipment scheduling in high volume factories (Q2565775) (← links)
- The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price (Q2569096) (← links)
- A multi-period machine assignment problem (Q2572247) (← links)
- Optimization and reconstruction of \(hv\)-convex (0,1)-matrices (Q2573240) (← links)
- Orthogonal drawings of graphs with vertex and edge labels (Q2573336) (← links)
- Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems (Q2576243) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- Equivalence of some LP-based lower bounds for the Golomb ruler problem (Q2581563) (← links)
- Improved approximation of maximum vertex cover (Q2583713) (← links)
- Assignment of swimmers to dual meet events (Q2583774) (← links)
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
- Container vessel scheduling with bi-directional flows (Q2643792) (← links)
- Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
- A polyhedral approach to bisubmodular function minimization (Q2661581) (← links)
- On additive approximate submodularity (Q2672599) (← links)
- Interactive optimization of submodular functions under matroid constraints (Q2695451) (← links)
- Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
- Tight Approximation Bounds for the Seminar Assignment Problem (Q2971167) (← links)
- A Probabilistic Analysis of the K-Location Problem (Q3136634) (← links)
- Probabilistic Partial Set Covering with an Oracle for Chance Constraints (Q4629339) (← links)
- ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers (Q4637829) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location (Q5131704) (← links)
- Optimal matrix-segmentation by rectangles (Q5902115) (← links)
- An approximate algorithm for nonlinear integer programming (Q5906393) (← links)
- The multi-level uncapacitated facility location problem is not submodular (Q5906501) (← links)
- An approximate algorithm for nonlinear integer programming (Q5906559) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm (Q5936075) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions (Q5945383) (← links)
- Facets of the \(p\)-cycle polytope (Q5946821) (← links)
- Comparison of column generation models for channel assignment in cellular networks (Q5946824) (← links)
- A method of transferring polyhedron between the intersection-form and the sum-form (Q5948790) (← links)
- A polynomially solvable special case of the unbounded knapsack problem (Q5949903) (← links)
- A branch-and-price algorithm for the Steiner tree packing problem. (Q5952785) (← links)
- The cable trench problem: Combining the shortest path and minimum spanning tree problems (Q5959396) (← links)
- The multi-level uncapacitated facility location problem is not submodular (Q5967058) (← links)
- Constraint generation approaches for submodular function maximization leveraging graph properties (Q6154401) (← links)
- The follower competitive facility location problem under the nested logit choice rule (Q6168505) (← links)
- An exact solution approach for the mobile multi‐agent sensing problem (Q6194842) (← links)