The following pages link to (Q4040221):
Displaying 50 items.
- Mingling: mixed-integer rounding with bounds (Q964180) (← links)
- Mixing MIR inequalities with two divisible coefficients (Q964181) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- Optimal selection of forest patches using integer and fractional programming (Q968037) (← links)
- A polyhedral approach to the stability of a family of coalitions (Q968155) (← links)
- Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem (Q969344) (← links)
- Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
- Routing traffic at hub facilities (Q972437) (← links)
- Scheduling internal audit activities: a stochastic combinatorial optimization problem (Q975756) (← links)
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311) (← links)
- A note on some collapse results of valued constraints (Q987814) (← links)
- A quantitative analysis of container vessel arrival planning strategies (Q989613) (← links)
- Positioning empty containers among multiple ports with leasing and purchasing considerations (Q989622) (← links)
- Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times (Q991842) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Efficient solutions for special zero-one programming problems (Q995926) (← links)
- Equilibrium relations in a capital asset market: A mean absolute deviation approach (Q1000348) (← links)
- Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
- Reconstructing (0,1)-matrices from projections using integer programming (Q1001203) (← links)
- On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times (Q1002081) (← links)
- A new lower bound for the single row facility layout problem (Q1003774) (← links)
- A ring-mesh topology design problem for optical transport networks (Q1009188) (← links)
- On stochastic dynamic programming for solving large-scale planning problems under uncertainty (Q1010297) (← links)
- A branching scheme for finding cost-minimal round robin tournaments (Q1011262) (← links)
- A hybrid algorithm for the unbounded knapsack problem (Q1013302) (← links)
- A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- A matching algorithm for the distribution of human pancreatic islets (Q1020642) (← links)
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (Q1026674) (← links)
- Multi-commodity supply network planning in the forest supply chain (Q1027559) (← links)
- MILP approach to pattern generation in logical analysis of data (Q1028471) (← links)
- Cliques, holes and the vertex coloring polytope (Q1029072) (← links)
- Airline network revenue management by multistage stochastic programming (Q1031952) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- Optimizing glass coating lines: MIP model and valid inequalities (Q1040997) (← links)
- Heuristics for the 0-1 multidimensional knapsack problem (Q1042198) (← links)
- Models for concurrent product and process design (Q1046061) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- The modified integer round-up property of the one-dimensional cutting stock problem (Q1127208) (← links)
- Search-hide games on trees (Q1129971) (← links)
- A reference direction approach to multiple objective integer linear programming (Q1130044) (← links)
- Performance modeling and optimization of networks of bridged LANs (Q1176441) (← links)
- Facets of two Steiner arborescence polyhedra (Q1181904) (← links)
- An interior point algorithm to solve computationally difficult set covering problems (Q1181917) (← links)
- Mathematical programs with a two-dimensional reverse convex constraint (Q1186268) (← links)
- An approximate method for local optima for nonlinear mixed integer programming problems (Q1200840) (← links)
- A review of open queueing network models of manufacturing systems (Q1205351) (← links)
- Design of manufacturing systems using queueing models (Q1205352) (← links)
- Polyhedral results for the precedence-constrained knapsack problem (Q1208480) (← links)
