Pages that link to "Item:Q759646"

The following pages link to An algorithm for the two-dimensional assortment problem (Q759646):

Displaying 21 items.

• A two-objective mathematical model without cutting patterns for one-dimensional assortment problems (Q555147) (← links)
• A multi-objective programming approach to 1.5-dimensional assortment problem (Q858415) (← links)
• A dynamic programming based heuristic for industrial buying of cardboard (Q1111922) (← links)
• Solution to the assortment problem via the genetic algorithm (Q1197091) (← links)
• An approximately global optimization method for assortment problems (Q1291783) (← links)
• A search strategy for the one-size assortment problem (Q1330558) (← links)
• A mixed-integer programming model for a class of assortment problems (Q1804067) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• Approximation solutions for the cutting stock `portfolio' problem (Q1825733) (← links)
• Knowledge-based systems for cutting stock problems (Q1825760) (← links)
• Two-dimensional homing sort (Q1944203) (← links)
• Solving packing problems by a distributed global optimization algorithm (Q1955364) (← links)
• A note on ``Reducing the number of binary variables in cutting stock problems'' (Q2448139) (← links)
• An optimization model for trim loss minimization in an automotive glass plant (Q2643973) (← links)
• Determining the best shipper sizes for sending products to customers (Q2803267) (← links)
• A comparison of solution methods for the assortment problem (Q3354860) (← links)
• An asymptotic distribution-free selection procedure for a two-way layout problem (Q3765049) (← links)
• The Discrete Two-Dimensional Assortment Problem (Q3783805) (← links)
• A column generation procedure for gang-rip saw arbor design and scheduling (Q4230062) (← links)
• (Q4254361) (← links)
• A fast algorithm for assortment optimization problems (Q5945327) (← links)