The following pages link to (Q4040221):
Displaying 50 items.
- Scheduling arc maintenance jobs in a network to maximize total flow over time (Q406493) (← links)
- Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup (Q420862) (← links)
- Tight bounds for periodicity theorems on the unbounded knapsack problem (Q421659) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- Clique-based facets for the precedence constrained knapsack problem (Q431007) (← links)
- Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
- Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem (Q434153) (← links)
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
- Feasibility in reverse convex mixed-integer programming (Q439456) (← links)
- A lexicographic semiorder polytope and probabilistic representations of choice (Q440019) (← links)
- Cuts from proofs: a complete and practical technique for solving linear inequalities over integers (Q453505) (← links)
- On the transportation problem with market choice (Q479018) (← links)
- Computational complexity analysis of the sensor location flow observability problem (Q479256) (← links)
- Optimization for a special class of traffic flow models: combinatorial and continuous approaches (Q480077) (← links)
- Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
- On the effects of combining objectives in multi-objective optimization (Q494690) (← links)
- Irreducible infeasible sets in convex mixed-integer programs (Q495724) (← links)
- The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- A simple greedy heuristic for linear assignment interdiction (Q513608) (← links)
- Maximizing a class of submodular utility functions with constraints (Q517299) (← links)
- Approximate solution of the \(p\)-median minimization problem (Q519693) (← links)
- MSO: a framework for bound-constrained black-box global optimization algorithms (Q524912) (← links)
- \(k\)-sum decomposition of strongly unimodular matrices (Q526424) (← links)
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
- On the core of routing games with revenues (Q532673) (← links)
- Maximum utility product pricing models and algorithms based on reservation price (Q535296) (← links)
- Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis (Q535673) (← links)
- Hooked on IP (Q537605) (← links)
- Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems (Q540668) (← links)
- Maximizing a class of submodular utility functions (Q543403) (← links)
- Approximation of linear fractional-multiplicative problems (Q543418) (← links)
- A class of polynomially solvable 0-1 programming problems and an application (Q547367) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
- Approximating the Pareto optimal set using a reduced set of objective functions (Q613484) (← links)
- The combinatorial bandwidth packing problem (Q621657) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- On the behavior of the \(N_{+}\)-operator under blocker duality (Q628328) (← links)
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs (Q633558) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- Mixed integer linear models for the optimization of dynamical transport networks (Q634782) (← links)
- Reachability determination in acyclic Petri nets by cell enumeration approach (Q644287) (← links)
- An integer programming approach to DNA sequence assembly (Q647296) (← links)
- Lexicography and degeneracy: Can a pure cutting plane algorithm work? (Q647393) (← links)
- A note on the split rank of intersection cuts (Q647399) (← links)
