The following pages link to (Q4254875):
Displaying 50 items.
- A survey of the standard location-routing problem (Q1698292) (← links)
- A frontier-based system of incentives for units in organisations with varying degrees of decentralisation (Q1711467) (← links)
- Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty (Q1713736) (← links)
- Global optimization for a class of nonlinear sum of ratios problem (Q1717663) (← links)
- Sharp bounds for the second-order general connectivity index of hexagonal chains (Q1721387) (← links)
- The rank pricing problem: models and branch-and-cut algorithms (Q1722958) (← links)
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience (Q1725611) (← links)
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging (Q1727732) (← links)
- Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach (Q1727735) (← links)
- A note on maximal covering location games (Q1727959) (← links)
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
- Optimized assignment patterns in mobile edge cloud networks (Q1734851) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- Location routing problems on trees (Q1735670) (← links)
- A stochastic optimization approach to shift scheduling with breaks adjustments (Q1738827) (← links)
- Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs (Q1749486) (← links)
- Robust decision making using a general utility set (Q1750483) (← links)
- The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
- On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← links)
- Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767) (← links)
- An analytical approach to the protection planning of a rail intermodal terminal network (Q1752835) (← links)
- Integer programming for urban design (Q1755415) (← links)
- Lagrangian relaxation and constraint generation for allocation and advanced scheduling (Q1761167) (← links)
- Heuristic solutions to the long-term unit commitment problem with cogeneration plants (Q1761973) (← links)
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (Q1762021) (← links)
- Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
- Bi-objective scheduling on a restricted batching machine (Q1782176) (← links)
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming (Q1789641) (← links)
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set (Q1926486) (← links)
- Integer linear programming models for grid-based light post location problem (Q1926907) (← links)
- Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) (← links)
- Could we use a million cores to solve an integer program? (Q1935943) (← links)
- Stronger instruments via integer programming in an observational study of late preterm birth outcomes (Q1951518) (← links)
- A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
- Algorithmic expedients for the \(S\)-labeling problem (Q2003435) (← links)
- Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem (Q2003574) (← links)
- A hybrid differential evolution algorithm with column generation for resource constrained job scheduling (Q2003586) (← links)
- A first look at picking dual variables for maximizing reduced cost fixing (Q2011594) (← links)
- Putting continuous metaheuristics to work in binary search spaces (Q2012877) (← links)
- Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868) (← links)
- Policy-based branch-and-bound for infinite-horizon multi-model Markov decision processes (Q2026970) (← links)
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
- Machine learning for combinatorial optimization: a methodological tour d'horizon (Q2029358) (← links)
- Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties (Q2029905) (← links)
- Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure (Q2029964) (← links)
- An integer programming approach for solving a generalized version of the Grundy domination number (Q2032968) (← links)
- Black-box combinatorial optimization using models with integer-valued minima (Q2043440) (← links)
- Efficient formulations for the traveling car renter problem and its quota variant (Q2047185) (← links)
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
