The following pages link to (Q4254875):
Displaying 50 items.
- Integer-programming software systems (Q817202) (← links)
- Solving planning and design problems in the process industry using mixed integer and global optimization (Q817211) (← links)
- Solving the minimum convex partition of point sets with integer programming (Q824341) (← links)
- On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming (Q839882) (← links)
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems (Q839891) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- Maximizing system lifetime in wireless sensor networks (Q872283) (← links)
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras (Q875019) (← links)
- Integer linear programming approaches for non-unique probe selection (Q876483) (← links)
- New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach (Q890005) (← links)
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem (Q896282) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- On a generalization of ``eight blocks to madness'' puzzle (Q906490) (← links)
- Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
- An efficient algorithm for solving convex-convex quadratic fractional programs (Q946299) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
- Synergistic modeling of call center operations (Q955448) (← links)
- Topology design of tensegrity structures via mixed integer programming (Q960791) (← links)
- An anytime deduction algorithm for the probabilistic logic and entailment problems (Q962834) (← links)
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching (Q964867) (← links)
- Optimal selection of forest patches using integer and fractional programming (Q968037) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
- Detecting critical nodes in sparse graphs (Q1013394) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- A general quantity discount and supplier selection mixed integer programming model (Q1018258) (← links)
- Comparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problems (Q1035283) (← links)
- On earliest deadline first scheduling for temporal consistency maintenance (Q1039295) (← links)
- An iterative approach to robust and integrated aircraft routing and crew scheduling (Q1046695) (← links)
- Computational integer programming (Q1290612) (← links)
- Supply chain optimization in the pulp mill industry -- IP models, column generation and novel constraint branches. (Q1426678) (← links)
- Accurate optimization models for interference constrained bandwidth allocation in cellular networks (Q1628035) (← links)
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming (Q1628043) (← links)
- An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem (Q1634095) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Capacity expansion of stochastic power generation under two-stage electricity markets (Q1651629) (← links)
- Minimizing average project team size given multi-skilled workers with heterogeneous skill levels (Q1651635) (← links)
- The green capacitated multi-item lot sizing problem with parallel machines (Q1651651) (← links)
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (Q1652284) (← links)
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- Scheduling pumpoff operations in onshore oilfields with electric-power constraints and variable cycle time (Q1652567) (← links)
- Redundancy system design for an aircraft door management system (Q1652598) (← links)
- Solution methods for the tray optimization problem (Q1653393) (← links)
- Maximum margin semi-supervised learning with irrelevant data (Q1669167) (← links)
- Extended formulation for hop constrained distribution network configuration problems (Q1681271) (← links)
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints (Q1681301) (← links)
- A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← links)
- Another pedagogy for mixed-integer Gomory (Q1688937) (← links)
