The following pages link to Claudio Arbib (Q429691):
Displaying 38 items.
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization (Q429692) (← links)
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application (Q706851) (← links)
- A polynomial characterization of some graph partitioning problems (Q1108810) (← links)
- A three-dimensional matching model for perishable production scheduling (Q1283066) (← links)
- Concurrent operations assignment and sequencing for particular assembly problems in flow lines (Q1357763) (← links)
- An optimization problem arising in the design of multiring systems (Q1576336) (← links)
- On the upper chromatic number of \((v_3,b_2)\)-configurations (Q1613359) (← links)
- On (\(P_{5}\), diamond)-free graphs (Q1613431) (← links)
- An improved integer linear programming formulation for the closest 0-1 string problem (Q1652195) (← links)
- On the stability number of the edge intersection of two graphs. (Q1853063) (← links)
- How to survive while visiting a graph (Q1962049) (← links)
- Number of bins and maximum lateness minimization in two-dimensional bin packing (Q2029951) (← links)
- Codon optimization by 0-1 linear programming (Q2177826) (← links)
- Almost always observable hybrid systems (Q2178194) (← links)
- Competitive location and pricing on a line with metric transportation costs (Q2282503) (← links)
- On envy-free perfect matching (Q2414450) (← links)
- Annals of OR-special volume in memory of Mario Lucertini (Q2480196) (← links)
- An optimization model for trim loss minimization in an automotive glass plant (Q2643973) (← links)
- (Q2741320) (← links)
- One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model (Q2803255) (← links)
- Optimum Solution of the Closest String Problem via Rank Distance (Q2835685) (← links)
- Exact and Asymptotically Exact Solutions for a Class of Assortment Problems (Q2901042) (← links)
- On LP relaxations for the pattern minimization problem (Q3008919) (← links)
- (Q3032060) (← links)
- Scheduling two chains of unit jobs on one machine: A polyhedral study (Q3100690) (← links)
- (Q3139126) (← links)
- (Q3139224) (← links)
- A competitive scheduling problem and its relevance to UMTS channel assignment (Q3156827) (← links)
- Cutting and Reuse: An Application from Automobile Component Manufacturing (Q3635152) (← links)
- (Q3817607) (← links)
- (Q3835330) (← links)
- (Q4028110) (← links)
- (Q4264549) (← links)
- (Q4495286) (← links)
- Sorting common operations to minimize the number of tardy jobs (Q4642466) (← links)
- Predicting deadlock in store‐and‐forward networks (Q5750381) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902508) (← links)
- One-dimensional stock cutting resilient against singular random defects (Q6106587) (← links)
