Pages that link to "Item:Q3114738"
From MaRDI portal
The following pages link to Improving Discrete Model Representations via Symmetry Considerations (Q3114738):
Displaying 50 items.
- An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems (Q319714) (← links)
- Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations (Q322692) (← links)
- A tabu search algorithm for application placement in computer clustering (Q337070) (← links)
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
- The stop-and-drop problem in nonprofit food distribution networks (Q478060) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- Stabilizer-based symmetry breaking constraints for mathematical programs (Q486387) (← links)
- A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
- Orbital branching (Q623461) (← links)
- Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
- Integer-programming software systems (Q817202) (← links)
- ILP approaches to the blockmodel problem (Q856277) (← links)
- The task assignment problem for unrestricted movement between workstation groups (Q880551) (← links)
- A Branch and Price algorithm for the \(k\)-splittable maximum flow problem (Q937408) (← links)
- Intermediate integer programming representations using value disjunctions (Q951104) (← links)
- Stochastic programming for nurse assignment (Q1001188) (← links)
- Complementary column generation and bounding approaches for set partitioning formulations (Q1001332) (← links)
- A ring-mesh topology design problem for optical transport networks (Q1009188) (← links)
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (Q1016064) (← links)
- Maximizing the minimum completion time on parallel machines (Q1029565) (← links)
- Cutting plane algorithms for solving a stochastic edge-partition problem (Q1040087) (← links)
- The impact of distribution system characteristics on computational tractability (Q1042484) (← links)
- Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations (Q1642979) (← links)
- Solution methods for the tray optimization problem (Q1653393) (← links)
- Optimizing high-level nuclear waste disposal within a deep geologic repository (Q1695772) (← links)
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
- Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain (Q1735180) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
- Service location grouping and pricing in transportation: application in air cargo (Q1754269) (← links)
- An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections (Q1756351) (← links)
- Integer programming formulations for the minimum weighted maximal matching problem (Q1758060) (← links)
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem (Q1762154) (← links)
- A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
- A distributionally robust optimization approach for stochastic elective surgery scheduling with limited intensive care unit capacity (Q2029907) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- A matheuristic for parallel machine scheduling with tool replacements (Q2030722) (← links)
- The multiphase course timetabling problem (Q2116932) (← links)
- Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor (Q2116934) (← links)
- Clustering clinical departments for wards to achieve a prespecified blocking probability (Q2260901) (← links)
- A new multi-objective mathematical model for the high-level synthesis of integrated circuits (Q2289180) (← links)
- Parallel machine scheduling with tool loading (Q2290906) (← links)
- On the maximum small-world subgraph problem (Q2327623) (← links)
- Modified orbital branching for structured symmetry with an application to unit commitment (Q2340280) (← links)
- Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
- Lexicographical order in integer programming (Q2405486) (← links)
- Polytopes associated with symmetry handling (Q2414904) (← links)
- A note on a symmetrical set covering problem: the lottery problem (Q2462109) (← links)
- A quantitative approach for scheduling activities to reduce set-up in multiple machine lines (Q2467267) (← links)
